Minimal dominating sets in interval graphs and trees
DOI10.1016/J.DAM.2016.01.038zbMATH Open1350.05121OpenAlexW2283788147MaRDI QIDQ344851FDOQ344851
Authors: Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger 
Publication date: 24 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.038
Recommendations
- On the number of minimal dominating sets on some graph classes
- The maximum number of minimal dominating sets in a tree
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On the enumeration and counting of minimal dominating sets in interval and permutation graphs
- Trees having many minimal dominating sets
Trees (05C05) 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
- Subset feedback vertex sets in chordal graphs
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Enumerating minimal subset feedback vertex sets
- On the number of minimal dominating sets on some graph classes
- Feedback vertex sets in tournaments
- Combinatorial bounds via measure and conquer
- On the enumeration of minimal dominating sets and related notions
- Enumerating maximal independent sets with applications to graph colouring.
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Finding induced subgraphs via minimal triangulations
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Enumeration of minimal dominating sets and variants
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- Trees having many minimal dominating sets
- On the enumeration and counting of minimal dominating sets in interval and permutation graphs
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Cited In (12)
- On the complexity of solution extension of optimization problems
- Majorization and the minimum number of dominating sets
- Minimal Double Dominating Sets in Trees
- Domination cover number of graphs
- On the number of minimal dominating sets on some graph classes
- Minimum-cost \(b\)-edge dominating sets on trees
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree
- Enumeration of minimal connected dominating sets for chordal graphs
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Invited talks
- Title not available (Why is that?)
- On the enumeration and counting of minimal dominating sets in interval and permutation graphs
This page was built for publication: Minimal dominating sets in interval graphs and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344851)
