Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration

DOI10.1007/978-3-642-27660-6_17zbMath1298.05246MaRDI QIDQ2891369

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

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_17

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)