Burling graphs, chromatic number, and orthogonal tree-decompositions

DOI10.1016/j.endm.2017.06.068zbMath1378.05057arXiv1703.07871OpenAlexW2600723303MaRDI QIDQ5915813

Veit Wiechert, Gwenaël Joret, Piotr Micek, Stefan Felsner, William T. jun. Trotter

Publication date: 18 January 2018

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numbertree decompositionspath decompositions

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Restricted frame graphs and a conjecture of Scott
• Triangle-free intersection graphs of line segments with large chromatic number
• Coloring rectangular blocks in 3-space
• On a Coloring Problem.
• Orthogonal Tree Decompositions of Graphs
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Burling graphs, chromatic number, and orthogonal tree-decompositions