Some results on graphs without long induced paths

DOI10.1002/(SICI)1097-0118(199605)22:1%3C23::AID-JGT4%3E3.0.CO;2-NzbMATH Open0849.05046OpenAlexW2078467531MaRDI QIDQ4879162FDOQ4879162

Authors: Jin Quan Dong 

Publication date: 22 May 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C23::aid-jgt4%3E3.0.co;2-n

Recommendations

• Some results on graphs without long induced paths
• A characterization of graphs without long induced paths
• Long induced paths in graphs
• On extremal graphs with no long paths
• Long induced paths in minor-closed graph classes and beyond
• Graphs containing finite induced paths of unbounded length
• Long induced paths and cycles in Kneser graphs
• Long cycles in graphs without Hamiltonian paths

zbMATH Keywords

distancedominate\(m\)-centerlong induced paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38)

Cited In (9)

• Graphs with no \(M\)-alternating paths between two vertices: an update
• Infinite versus finite graph domination
• Pushing vertices in digraphs without long induced cycles
• A short note on graphs with long Thomason chains
• Complete description of forbidden subgraphs in the structural domination problem
• Title not available (Why is that?)
• A characterization of graphs without long induced paths
• Some results on weighted graphs without induced cycles of nonpositive weights
• Long induced paths in graphs

This page was built for publication: Some results on graphs without long induced paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879162)