Minimal dominating sets in graph classes: combinatorial bounds and enumeration
DOI10.1007/978-3-642-27660-6_17zbMATH Open1298.05246OpenAlexW1497588846MaRDI QIDQ2891369FDOQ2891369
Authors: Jean-François Couturier, Pinar Heggernes, Pim Van 't Hof, Dieter Kratsch 
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
Recommendations
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Enumerating minimal dominating sets in chordal graphs
- On the number of minimal dominating sets on some graph classes
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- On maximum number of minimal dominating sets in graphs
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Exact exponential algorithms.
- Algorithmic graph theory and perfect graphs
- On cliques in graphs
- Node-Deletion Problems on Bipartite Graphs
- Combinatorial bounds via measure and conquer
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Finding induced subgraphs via minimal triangulations
- Enumeration of minimal dominating sets and variants
- A note on the complexity of the chromatic number problem
- The domatic number problem on some perfect graph families
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- Feedback vertex sets in tournaments
Cited In (18)
- Title not available (Why is that?)
- Elimination properties for minimal dominating sets of graphs
- Bounds on the maximum number of minimum dominating sets
- Combinatorial bounds via measure and conquer
- On the number of optimal identifying codes in a twin-free graph
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Title not available (Why is that?)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On the number of minimal dominating sets on some graph classes
- Enumerating minimal dominating sets in chordal graphs
- On maximum number of minimal dominating sets in graphs
- Minimal dominating sets in interval graphs and trees
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Algorithms and Computation
- Maximum number of minimum dominating and minimum total dominating sets
- On the minimum vertex covering transversal dominating sets in graphs and their classification
- Counting minimal dominating sets
- On the enumeration of minimal non-pairwise compatibility graphs
This page was built for publication: Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891369)
