Sparse graphs without long induced paths

DOI10.1016/j.jctb.2023.12.003arXiv2304.09679OpenAlexW4366464678MaRDI QIDQ6196152

Jean-Florent Raymond, Oscar Defrain

Publication date: 14 March 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

degeneracycoloring numberstypical induced subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Cites Work

• Sparsity. Graphs, structures, and algorithms
• Long induced paths in graphs
• A Ramsey-type theorem for traceable graphs
• Polynomial expansion and sublinear separators
• Orderings on graphs and game coloring number
• Long induced paths in minor-closed graph classes and beyond

This page was built for publication: Sparse graphs without long induced paths