Burling graphs revisited. III: Applications to \(\chi \)-boundedness

DOI10.1016/j.ejc.2023.103850arXiv2112.11970OpenAlexW4226174972MaRDI QIDQ6146493

Nicolas Trotignon, Pegah Pournajafi

Publication date: 5 February 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Burling sequenceunbounded chromatic number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Restricted frame graphs and a conjecture of Scott
• Triangle-free intersection graphs of line segments with large chromatic number
• On graphs with no induced subdivision of \(K_4\)
• Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
• Burling graphs revisited. I: New characterizations
• Graph Theory and Probability
• A survey of χ‐boundedness

This page was built for publication: Burling graphs revisited. III: Applications to \(\chi \)-boundedness