Long induced paths in minor-closed graph classes and beyond

DOI10.37236/11029OpenAlexW4310381270MaRDI QIDQ2684889

Claire Hilaire, Jean-Florent Raymond

Publication date: 17 February 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.03880

zbMATH Keywords

induced pathsmaximum lengths of paths

Mathematics Subject Classification ID

Graph polynomials (05C31) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items

Sparse graphs without long induced paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower and upper bounds for long induced paths in 3-connected planar graphs
• Sparsity. Graphs, structures, and algorithms
• Long induced paths in graphs
• A Ramsey-type theorem for traceable graphs
• Graph minors. XVI: Excluding a non-planar graph
• Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation
• Long cycles in 3-connected graphs
• Upper bounds to the clique width of graphs
• Layered separators in minor-closed graph classes with applications
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Long induced paths in 3-connected planar graphs
• Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs