Perfect connected-dominant graphs

DOI10.7151/DMGT.1192MaRDI QIDQ4458977zbMATH OpenOpenAlexFDO

Authors I.È. Zverovich

Publication date 25 March 2004

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/60c679d4d90dc5da015c465316858513b5870488

zbMATH Keywords

domination numberconnected domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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)

• On graphs with no proper perfect dominating set
• scientific article; zbMATH DE number 10597 (Why is no real title available?)
• The price of connectivity for cycle transversals
• scientific article; zbMATH DE number 4160769 (Why is no real title available?)
• Complete description of forbidden subgraphs in the structural domination problem
• Dominating cliques in \(P_ 5\)-free graphs
• The price of connectivity for cycle transversals
• On graphs for which the connected domination number is at most the total domination number
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
• scientific article; zbMATH DE number 2114467 (Why is no real title available?)
• Some variations of perfect graphs
• The price of connectivity for feedback vertex set
• The price of connectivity for dominating set: upper bounds and complexity
• Connected domination
• scientific article; zbMATH DE number 5553874 (Why is no real title available?)
• Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
• On weakly connected domination in graphs. II.
• Graphs without induced P₅and C₅

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)