A characterization of graphs without long induced paths
From MaRDI portal
Recommendations
Cited in
(25)- Characterization of \(P_{6}\)-free graphs
- A characterization of graphs where the independence number equals the radius
- Some results on graphs without long induced paths
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- An algorithm to find two distance domination parameters in a graph
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
- Complete description of forbidden subgraphs in the structural domination problem
- Dominating cliques in \(P_ 5\)-free graphs
- Domination properties and induced subgraphs
- Pushing vertices in digraphs without long induced cycles
- Characterization of graphs dominated by induced paths
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- scientific article; zbMATH DE number 786168 (Why is no real title available?)
- Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Infinite versus finite graph domination
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- Long induced paths in graphs
- Stable sets in certain \(P_6\)-free graphs
- The ratio of the distance irredundance and domination numbers of a graph
- Centers in path graphs
- On efficient domination for some classes of \(H\)-free bipartite graphs
- Tree-Width and Optimization in Bounded Degree Graphs
- Dominating subgraphs in graphs with some forbidden structures
- On \(m\)-centers in \(P_ t\)-free graphs
This page was built for publication: A characterization of graphs without long induced paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204490)
