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: 2092; Prenosov: 158 Celotno besedilo (648,51 KB)
Ključne besede: povezana dominantna množica, hereditarni grafovski razred, dualno Spernerjev hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraphObjavljeno v RUP: 15.10.2015; Ogledov: 3407; Prenosov: 114 Povezava na celotno besedilo