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 algorithmObjavljeno v RUP: 04.04.2019; Ogledov: 2187; Prenosov: 158 Celotno besedilo (648,51 KB)
Ključne besede: weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithmsObjavljeno v RUP: 21.01.2019; Ogledov: 1847; Prenosov: 282 Povezava na celotno besedilo
Ključne besede: k-domination, total k-domination, proper interval graph, polynomial-time algorithmObjavljeno v RUP: 17.09.2018; Ogledov: 2083; Prenosov: 149 Povezava na celotno besedilo
Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graphObjavljeno v RUP: 17.09.2018; Ogledov: 2043; Prenosov: 67 Povezava na celotno besedilo