Minimal dominating sets in graph classes: Combinatorial bounds and enumeration - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2013

Dates and versions

hal-02332232 , version 1 (24-10-2019)

Identifiers

Cite

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, 2013, 487, pp.82-94. ⟨10.1016/j.tcs.2013.03.026⟩. ⟨hal-02332232⟩
22 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More