11. Avoidable vertices and edges in graphsJesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič, 2019, objavljeni znanstveni prispevek na konferenci Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Objavljeno v RUP: 20.08.2019; Ogledov: 2067; Prenosov: 156 Povezava na celotno besedilo |
12. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma, 2019, izvirni znanstveni članek Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph Objavljeno v RUP: 26.07.2019; Ogledov: 1594; Prenosov: 99 Povezava na celotno besedilo |
13. |
14. |
15. Linear separation of connected dominating sets in graphsNina Chiarelli, Martin Milanič, 2019, izvirni znanstveni članek Ključne besede: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function, polynomial-time algorithm Objavljeno v RUP: 04.04.2019; Ogledov: 2086; Prenosov: 158 Celotno besedilo (648,51 KB) |
16. Mamart, Siwaporn: A group commutator involving the last distance matrix and dual distance matrix of a Q-polynomial distance-regular graph: the Hamming graph case. - Graphs Combin. 34 (2018), no. 4, 803--817Safet Penjić, 2018, recenzija, prikaz knjige, kritika Ključne besede: distance-regular graph, Q-polynomial, distance matrix, dual distance matrix Objavljeno v RUP: 21.01.2019; Ogledov: 1534; Prenosov: 15 Povezava na celotno besedilo |
17. |
18. |
19. |
20. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava, 2018, objavljeni znanstveni prispevek na konferenci Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph Objavljeno v RUP: 17.09.2018; Ogledov: 1984; Prenosov: 67 Povezava na celotno besedilo |