Tree-chromatic number
type: Item
instance of: scholarly article
title: Tree-chromatic number
zbMATH Open document ID: 1327.05125
author: Paul Seymour
published in: Journal of Combinatorial Theory. Series B
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6519962
zbMATH Keywords: induced subgraph
zbMATH Keywords: colouring
zbMATH Keywords: tree-decomposition
MaRDI profile type: Publication
full work available at URL: j.jctb.2015.08.002
OpenAlex ID: W2168287607
cites work: Graph Theory and Probability
cites work: Q5749319
cites work: S-functions for graphs
cites work: \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
cites work: Graph minors. III. Planar tree-width
cites work: Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes
cites work: Minimal completely separating systems
DOI: 10.1016/J.JCTB.2015.08.002
Recommended article: On the chromatic number of tree graphs
Recommended article: Chromatic number and subtrees of graphs
Recommended article: Q4710839
Recommended article: Total chromatic sum for trees
Recommended article: Chromaticity of two-trees
Recommended article: On the Locating Chromatic Number of Trees
Recommended article: Notes on tree- and path-chromatic number
Recommended article: Enumeration of equicolorable trees
Recommended article: Chromatic polynomials of generalized trees
description: scientific article; zbMATH DE number 6519962