1. |
2. |
3. |
4. |
5. |
6. 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: 03.04.2019; Ogledov: 2776; Prenosov: 160 Celotno besedilo (648,51 KB) |
7. |
8. |
9. |
10. On hereditary efficiently dominatable graphsMartin Milanič, 2011, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: popolna koda, učinkovita dominacija, grafi z učinkovito dominantno množico, polinomski algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes Objavljeno v RUP: 14.10.2015; Ogledov: 4035; Prenosov: 257 Povezava na celotno besedilo |