Domination properties and induced subgraphs

DOI10.1016/0012-365X(93)90138-JzbMath0784.05030OpenAlexW2032306835MaRDI QIDQ686437

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

distancediameterpathinduced subgraphcircuitforbidden subgraph\(k\)- dominating set

Mathematics Subject Classification ID

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

Related Items (4)

Characterization of graphs dominated by induced paths ⋮ Characterization of \(P_{6}\)-free graphs ⋮ Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs ⋮ Complete description of forbidden subgraphs in the structural domination problem

Cites Work

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

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