Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
From MaRDI portal
Publication:3393420
DOI10.1137/070699482zbMath1181.05074OpenAlexW2005449342MaRDI QIDQ3393420
Publication date: 20 August 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070699482
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time ⋮ The complexity of connected dominating sets and total dominating sets with specified induced subgraphs ⋮ On graphs for which the connected domination number is at most the total domination number ⋮ A note on connected dominating sets of distance-hereditary graphs ⋮ Distance domination versus iterated domination ⋮ On the existence of total dominating subgraphs with a prescribed additive hereditary property ⋮ Hypergraphs with large domination number and with edge sizes at least three ⋮ On dominating sets whose induced subgraphs have a bounded diameter ⋮ Transversals and domination in uniform hypergraphs ⋮ Perfect matchings in total domination critical graphs ⋮ Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs ⋮ Infinite versus finite graph domination ⋮ On maximum independent sets in \(P_{5}\)-free graphs ⋮ Connected Domination ⋮ Complete description of forbidden subgraphs in the structural domination problem ⋮ Domination, coloring and stability in \(P_5\)-reducible graphs ⋮ On connected dominating sets of restricted diameter
