Characterization of graphs dominated by induced paths
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1247724 (Why is no real title available?)
- scientific article; zbMATH DE number 2188424 (Why is no real title available?)
- A characterization of domination reducible graphs
- A characterization of graphs without long induced paths
- Dominating cliques in \(P_ 5\)-free graphs
- Dominating cliques in graphs
- Dominating sets with small clique covering number
- Domination properties and induced subgraphs
- Hereditarily dominated graphs
- On the existence of two non-neighboring subgraphs in a graph
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
Cited in
(8)- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- Minimum eccentricity shortest path problem: an approximation algorithm and relation with the \(k\)-laminarity problem
- scientific article; zbMATH DE number 6522554 (Why is no real title available?)
- Complete description of forbidden subgraphs in the structural domination problem
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- A characterization of domination reducible graphs
- On the minimum eccentricity isometric cycle problem
- A note on path domination
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)
