Minimal dominating sets in graph classes: Combinatorial bounds and enumeration

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof^*, Dieter Kratsch

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

38 Citations (Scopus)

17 Downloads (Pure)

Original language	English
Pages (from-to)	82-94
Number of pages	13
Journal	Theoretical computer science
Volume	487
Early online date	9 Apr 2013
DOIs	https://doi.org/10.1016/j.tcs.2013.03.026
Publication status	Published - 27 May 2013
Externally published	Yes

Access to Document

@article{e1b84ac6c8eb451caf6b54b62dc3e9c8,

title = "Minimal dominating sets in graph classes: Combinatorial bounds and enumeration",

author = "Jean-Fran{\c c}ois Couturier and Pinar Heggernes and {van 't Hof}, Pim and Dieter Kratsch",

year = "2013",

month = may,

day = "27",

doi = "10.1016/j.tcs.2013.03.026",

language = "English",

volume = "487",

pages = "82--94",

journal = "Theoretical computer science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - Minimal dominating sets in graph classes

T2 - Combinatorial bounds and enumeration

AU - Couturier, Jean-François

AU - Heggernes, Pinar

AU - van 't Hof, Pim

AU - Kratsch, Dieter

PY - 2013/5/27

Y1 - 2013/5/27

U2 - 10.1016/j.tcs.2013.03.026

DO - 10.1016/j.tcs.2013.03.026

M3 - Article

SN - 0304-3975

VL - 487

SP - 82

EP - 94

JO - Theoretical computer science

JF - Theoretical computer science

ER -