Domination properties and induced subgraphs

DOI10.1016/0012-365X(93)90138-JMaRDI QIDQ686437zbMATH OpenOpenAlexFDO

Authors Zsolt Tuza, Gábor Bacsó

Publication date 17 March 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90138-j

zbMATH Keywords

distancediameterinduced subgraphcircuitpathforbidden subgraph\(k\)- dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 2188424
• scientific article; zbMATH DE number 1247724
• Graphs without induced P₅and C₅
• Graph Domination in Distance Two
• Domination using induced cliques in graphs

Cites work

• A characterization of graphs without long induced paths
• Dominating cliques in \(P_ 5\)-free graphs
• Dominating cliques in graphs

Cited in

(10)

• Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
• scientific article; zbMATH DE number 2188424 (Why is no real title available?)
• Complete description of forbidden subgraphs in the structural domination problem
• Characterization of graphs dominated by induced paths
• Characterization of \(P_{6}\)-free graphs
• scientific article; zbMATH DE number 786168 (Why is no real title available?)
• A note on path domination
• Graphs without induced P₅and C₅
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• Hereditarily dominated graphs

This page was built for publication: Domination properties and induced subgraphs

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