Characterization of graphs dominated by induced paths
From MaRDI portal
Publication:868348
DOI10.1016/J.DISC.2005.11.035zbMATH Open1114.05069OpenAlexW2022959563MaRDI QIDQ868348FDOQ868348
Authors: 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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)
Cites Work
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- Dominating cliques in \(P_ 5\)-free graphs
- Title not available (Why is that?)
- A characterization of graphs without long induced paths
- A characterization of domination reducible graphs
- Dominating cliques in graphs
- Title not available (Why is that?)
- Domination properties and induced subgraphs
- Hereditarily dominated graphs
- On the existence of two non-neighboring subgraphs in a graph
- Dominating sets with small clique covering number
Cited In (7)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem
- On the minimum eccentricity isometric cycle problem
- Complete description of forbidden subgraphs in the structural domination problem
- Title not available (Why is that?)
- A characterization of domination reducible graphs
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
This page was built for publication: Characterization of graphs dominated by induced paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868348)
