Tree-chromatic number

DOI10.1016/J.JCTB.2015.08.002MaRDI QIDQ896001zbMATH OpenOpenAlexFDO

Authors Paul 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) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the chromatic number of tree graphs
• Chromatic number and subtrees of graphs
• scientific article; zbMATH DE number 4257
• Total chromatic sum for trees
• Chromaticity of two-trees
• On the locating chromatic number of trees
• Notes on tree- and path-chromatic number
• Enumeration of equicolorable trees
• Chromatic polynomials of generalized trees

Cites work

• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Graph Theory and Probability
• Graph minors. III. Planar tree-width
• Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes
• Minimal completely separating systems
• S-functions for graphs
• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth

Cited in

(16)

• 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
• On the chromatic number of tree graphs
• Bounded-diameter tree-decompositions
• Notes on tree- and path-chromatic number
• Treewidth versus clique number. II: Tree-independence number
• Burling graphs, chromatic number, and orthogonal tree-decompositions
• Enumeration of equicolorable trees
• scientific article; zbMATH DE number 3863230 (Why is no real title available?)
• scientific article; zbMATH DE number 1866895 (Why is no real title available?)
• Tree-chromatic number is not equal to path-chromatic number
• Partial \(k\)-trees with maximum chromatic number
• Orthogonal tree decompositions of graphs
• Entire chromatic number of 1-tree.
• scientific article; zbMATH DE number 1159282 (Why is no real title available?)

This page was built for publication: Tree-chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896001)