Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs

DOI10.1137/070699482MaRDI QIDQ3393420zbMATH OpenOpenAlexFDO

Authors Zsolt Tuza

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

zbMATH Keywords

dominating setforbidden induced subgraphinduced-hereditary propertyleaf graphstructural domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Hereditarily dominated graphs
• Dominating Bipartite Subgraphs in Graphs
• scientific article; zbMATH DE number 2188424
• Characterization of graphs dominated by induced paths
• Domination properties and induced subgraphs

Cited in

(18)

• Complete description of forbidden subgraphs in the structural domination problem
• Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
• Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
• Domination, coloring and stability in \(P_5\)-reducible graphs
• On connected dominating sets of restricted diameter
• On dominating sets whose induced subgraphs have a bounded diameter
• Connected domination
• 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
• Hypergraphs with large domination number and with edge sizes at least three
• On the existence of total dominating subgraphs with a prescribed additive hereditary property
• Transversals and domination in uniform hypergraphs
• Perfect matchings in total domination critical graphs
• On maximum independent sets in \(P_{5}\)-free graphs
• Hereditarily dominated graphs
• Infinite versus finite graph domination

This page was built for publication: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393420)