Enumerating minimal connected dominating sets in graphs of bounded chordality
From MaRDI portal
(Redirected from Publication:278724)
Recommendations
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Enumeration of minimal connected dominating sets for chordal graphs
- Enumerating minimal dominating sets in chordal graphs
- Enumerating minimal dominating sets in chordal bipartite graphs
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimum connected dominating sets in finite graphs
- On the enumeration of minimal dominating sets and related notions
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1262809 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Algorithmic graph theory and perfect graphs
- An exact algorithm for connected red-blue dominating set
- Asteroidal Triple-Free Graphs
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Combinatorial bounds via measure and conquer
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Distance-hereditary graphs
- Enumerating maximal independent sets with applications to graph colouring.
- Enumerating minimal subset feedback vertex sets
- Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
- Exact algorithms for graph homomorphisms
- Exact exponential algorithms.
- Feedback vertex sets in tournaments
- Graph Classes: A Survey
- Large Induced Subgraphs via Triangulations and CMSO
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimal triangulations of graphs: a survey
- On cliques in graphs
- On the enumeration of minimal dominating sets and related notions
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- On the number of minimal dominating sets on some graph classes
- On the number of minimal separators in graphs
- Subset feedback vertex sets in chordal graphs
Cited in
(15)- Locally definable vertex set properties are efficiently enumerable
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
- scientific article; zbMATH DE number 7650296 (Why is no real title available?)
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Minimal Roman dominating functions: extensions and enumeration
- Enumerating minimal dominating sets in chordal graphs
- Below all subsets for minimal connected dominating set
- Enumeration of minimal connected dominating sets for chordal graphs
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- On the number of connected sets in bounded degree graphs
- Linear-time generation of random chordal graphs
- Enumeration of minimal dominating sets and variants
- Minimal Roman dominating functions: extensions and enumeration
This page was built for publication: Enumerating minimal connected dominating sets in graphs of bounded chordality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q278724)
