Minimal dominating sets in graph classes: combinatorial bounds and enumeration
From MaRDI portal
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
- On maximum number of minimal dominating sets in graphs
- Enumeration and maximum number of minimal dominating sets for chordal graphs
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A faster algorithm for dominating set analyzed by the potential method
- A note on the complexity of the chromatic number problem
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- An O(N + M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
- An exact algorithm for subset feedback vertex set on chordal graphs
- Combinatorial bounds via measure and conquer
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Enumerating minimal subset feedback vertex sets
- Enumeration of minimal dominating sets and variants
- Exact exponential algorithms.
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Feedback vertex sets in tournaments
- Finding induced subgraphs via minimal triangulations
- Graph Classes: A Survey
- Incidence matrices and interval graphs
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Node-Deletion Problems on Bipartite Graphs
- On cliques in graphs
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets
- Optimal greedy algorithms for indifference graphs
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- The Comparability Graph of a Tree
- The domatic number problem on some perfect graph families
- Threshold graphs and related topics
- Trees having many minimal dominating sets
Cited in
(36)- On the enumeration of minimal non-pairwise compatibility graphs
- Locally definable vertex set properties are efficiently enumerable
- scientific article; zbMATH DE number 5953680 (Why is no real title available?)
- Elimination properties for minimal dominating sets of graphs
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Combinatorial bounds via measure and conquer
- Linear-time algorithm for generating c-isolated bicliques
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- scientific article; zbMATH DE number 5131681 (Why is no real title available?)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On the number of minimal dominating sets on some graph classes
- Domination cover number of graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Minimal Roman dominating functions: extensions and enumeration
- Enumeration of maximal irredundant sets for claw-free graphs
- Enumerating minimal dominating sets in chordal graphs
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- On maximum number of minimal dominating sets in graphs
- Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
- Minimum cost flow problem with conflicts
- Completion and decomposition of hypergraphs into dominating sets of graphs
- Enumerating Minimal Tropical Connected Sets
- Enumeration of minimal connected dominating sets for chordal graphs
- Minimal dominating sets in interval graphs and trees
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Minimum Dominating Set for the Prism Graph Family
- An improved exact algorithm for minimum dominating set in chordal graphs
- The equitable non-split domination number of graphs
- Algorithms and Computation
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- On the minimum vertex covering transversal dominating sets in graphs and their classification
- Minimal Roman dominating functions: extensions and enumeration
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
- Upper bound for the number of maximal dissociation sets in trees
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 Q387008)
