Perfect connected-dominant graphs
From MaRDI portal
Publication:4458977
DOI10.7151/dmgt.1192zbMath1037.05038MaRDI QIDQ4458977
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
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
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, The price of connectivity for feedback vertex set, Some variations of perfect graphs, The price of connectivity for cycle transversals, Complete description of forbidden subgraphs in the structural domination problem, 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