Perfect connected-dominant graphs

DOI10.7151/dmgt.1192zbMath1037.05038OpenAlexW1985038305MaRDI QIDQ4458977

Igor Edm. 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)

Related Items (12)

Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity ⋮ The Price of Connectivity for Cycle Transversals ⋮ 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 ⋮ Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs ⋮ The price of connectivity for feedback vertex set ⋮ Some variations of perfect graphs ⋮ The price of connectivity for cycle transversals ⋮ Connected Domination ⋮ Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width ⋮ Complete description of forbidden subgraphs in the structural domination problem ⋮ On weakly connected domination in graphs. II.

This page was built for publication: Perfect connected-dominant graphs