Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number*

DOI10.1002/jgt.22121zbMath1370.05064arXiv1505.06234OpenAlexW2962696666MaRDI QIDQ5360884

Tony Huynh, Ringi Kim

Publication date: 26 September 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberMycielski graphstree-decompositionspath-decompositions

Mathematics Subject Classification ID

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

Related Items (2)

Orthogonal Tree Decompositions of Graphs ⋮ Notes on tree- and path-chromatic number

This page was built for publication: Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number^*