Tree-chromatic number

DOI10.1016/j.jctb.2015.08.002zbMath1327.05125OpenAlexW2168287607MaRDI QIDQ896001

P. D. Seymour

Publication date: 11 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2015.08.002

zbMATH Keywords

colouringinduced subgraphtree-decomposition

Mathematics Subject Classification ID

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

Related Items (6)

Treewidth versus clique number. II: Tree-independence number ⋮ Orthogonal Tree Decompositions of Graphs ⋮ Notes on tree- and path-chromatic number ⋮ Separating tree-chromatic number from path-chromatic number ⋮ \(H\)-colouring \(P_t\)-free graphs in subexponential time ⋮ In absence of long chordless cycles, large tree-width becomes a local phenomenon

Cites Work

• Unnamed Item
• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
• Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes
• Graph minors. III. Planar tree-width
• S-functions for graphs
• Graph Theory and Probability
• Minimal completely separating systems

This page was built for publication: Tree-chromatic number