Separating tree-chromatic number from path-chromatic number

DOI10.1016/j.jctb.2019.02.003zbMath1415.05113arXiv1703.03973OpenAlexW2913680851MaRDI QIDQ2312619

Tamás Mészáros, Libby Taylor, Piotr Micek, Heather C. Smith, Fidel Barrera-Cruz, Stefan Felsner, William T. jun. Trotter

Publication date: 17 July 2019

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

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

zbMATH Keywords

binary treeRamsey theorytree-decomposition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (3)

Orthogonal Tree Decompositions of Graphs ⋮ Notes on tree- and path-chromatic number ⋮ Comparing Dushnik-Miller dimension, Boolean dimension and local dimension

Cites Work

• Unnamed Item
• Tree-chromatic number
• A Ramsey theorem for trees
• Graph Theory and Probability

This page was built for publication: Separating tree-chromatic number from path-chromatic number