Recommendations
- scientific article; zbMATH DE number 4160769
- scientific article; zbMATH DE number 933213
- Domatically perfect graphs
- Dominating sets in perfect graphs
- scientific article; zbMATH DE number 3873384
- scientific article; zbMATH DE number 2114467
- PERFECT EDGE DOMINATION IN GRAPHS
- scientific article; zbMATH DE number 10597
- Connected p-domination in graphs
- Connected domination of regular graphs
Cited in
(19)- Complete description of forbidden subgraphs in the structural domination problem
- Dominating cliques in \(P_ 5\)-free graphs
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- On weakly connected domination in graphs. II.
- The price of connectivity for cycle transversals
- Connected domination
- scientific article; zbMATH DE number 4160769 (Why is no real title available?)
- scientific article; zbMATH DE number 5553874 (Why is no real title available?)
- The price of connectivity for dominating set: upper bounds and complexity
- On graphs for which the connected domination number is at most the total domination number
- Graphs without induced P5and C5
- scientific article; zbMATH DE number 10597 (Why is no real title available?)
- scientific article; zbMATH DE number 2114467 (Why is no real title available?)
- The price of connectivity for feedback vertex set
- On graphs with no proper perfect dominating set
- Some variations of perfect graphs
- The price of connectivity for cycle transversals
This page was built for publication: Perfect connected-dominant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458977)
