A note on an induced subgraph characterization of domination perfect graphs
From MaRDI portal
Publication:516908
DOI10.1016/j.dam.2016.09.040zbMath1358.05210OpenAlexW2532357315MaRDI QIDQ516908
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.040
Related Items
Perfect graphs for domination games, Computing dense and sparse subgraphs of weakly closed graphs, On the price of independence for vertex cover, feedback vertex set and odd cycle transversal, Common domination perfect graphs, Unnamed Item, Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs, Models and algorithms for the product pricing with single-minded customers requesting bundles, Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On domination and independent domination numbers of a graph
- On graphs with equal domination and independent domination numbers
- A linear algorithm for the domination number of a tree
- Upper domination and upper irredundance perfect graphs
- A characterization of \(\Gamma\alpha(k)\)-perfect graphs
- Perfect graphs of strong domination and independent strong domination
- Strong equality of domination parameters in trees
- Critical concepts in domination
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Construction of trees and graphs with equal domination parameters
- Unique irredundance, domination and independent domination in graphs
- A characterization of domination perfect graphs
- A note on the characterization of domination perfect graphs
- k-Bounded classes of dominant-independent perfect graphs
- An induced subgraph characterization of domination perfect graphs
