Characterization of graphs dominated by induced paths

DOI10.1016/J.DISC.2005.11.035zbMath1114.05069OpenAlexW2022959563MaRDI QIDQ868348

Margit Voigt, Gábor Bacsó, Zsolt Tuza

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.035

zbMATH Keywords

forbidden induced subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

On the minimum eccentricity isometric cycle problem ⋮ Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem ⋮ Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs ⋮ Complete description of forbidden subgraphs in the structural domination problem

Cites Work

• Unnamed Item
• Unnamed Item
• Domination properties and induced subgraphs
• Hereditarily dominated graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• On the existence of two non-neighboring subgraphs in a graph
• Dominating cliques in \(P_ 5\)-free graphs
• A characterization of domination reducible graphs
• A characterization of graphs without long induced paths
• Dominating sets with small clique covering number
• Dominating cliques in graphs

This page was built for publication: Characterization of graphs dominated by induced paths