Minimal dominating sets in graph classes: Combinatorial bounds and enumeration

Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02332232
Contributor : Jean-Francois Couturier <>
Submitted on : Thursday, October 24, 2019 - 4:45:48 PM
Last modification on : Friday, October 25, 2019 - 2:04:58 AM

Links full text

Identifiers

Citation

Jean-François Couturier, Pinar Heggernes, Pim van ’t Hof, Dieter Kratsch. Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theoretical Computer Science, Elsevier, 2013, 487, pp.82-94. ⟨10.1016/j.tcs.2013.03.026⟩. ⟨hal-02332232⟩

Share

Metrics

Record views

6