Ključne besede: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problemObjavljeno v RUP: 19.05.2020; Ogledov: 5144; Prenosov: 64 Povezava na celotno besedilo
Ključne besede: maximal independent set, almost well-covered graph, independence gap, girthObjavljeno v RUP: 06.12.2018; Ogledov: 4549; Prenosov: 66 Povezava na celotno besedilo