An induced subgraph characterization of domination perfect graphs
From MaRDI portal
Recommendations
Cited in
(45)- Dominating sets in perfect graphs
- Independent domination in finitely defined classes of graphs
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- Upper domination and upper irredundance perfect graphs
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
- Domination problems with no conflicts
- Perfect graphs of strong domination and independent strong domination
- A characterization of domination reducible graphs
- (In)approximability of maximum minimal FVS
- Locating-dominating sets: from graphs to oriented graphs
- On the computational complexity of the Helly number in the \(P_3\) and related convexities
- The \textsc{red-blue separation} problem on graphs
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Construction of trees and graphs with equal domination parameters
- On weakly connected domination in graphs. II.
- Unique irredundance, domination and independent domination in graphs
- Perfect graphs for domination games
- Domination on Cocomparability Graphs
- Independent Domination in Triangle Graphs
- A characterization of domination perfect graphs
- scientific article; zbMATH DE number 91051 (Why is no real title available?)
- scientific article; zbMATH DE number 1507962 (Why is no real title available?)
- A note on the characterization of domination perfect graphs
- Independent dominating set problem revisited
- Graphs with equal domination and independent domination numbers
- Domatically perfect graphs
- A note on an induced subgraph characterization of domination perfect graphs
- Optimality program in segment and string graphs
- \(i\gamma(1)\)-perfect graphs
- In)approximability of Maximum Minimal FVS
- Computing dense and sparse subgraphs of weakly closed graphs
- Edge deletion to tree-like graph classes
- The \textsc{Red-Blue Separation} problem on graphs
- Common domination perfect graphs
- Red-blue unshared dominators
- Independent dominating sets in planar triangulations (extended abstract)
- Perfect graphs involving semitotal and semipaired domination
- On Camby-Plein's characterization of domination perfect graphs
- Ramsey-type results on parameters related to domination
- Temporal dominating set and temporal vertex cover under the lens of degree restrictions
- Algorithms and complexity for monitoring edge-geodetic sets in graphs
- On the (in)approximability of the monitoring edge geodetic set problem
- \(\alpha \)-domination perfect trees
- Extremal perfect graphs for a bound on the domination number
This page was built for publication: An induced subgraph characterization of domination perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857437)
