Tree-chromatic number
From MaRDI portal
Publication:896001
DOI10.1016/J.JCTB.2015.08.002zbMATH Open1327.05125OpenAlexW2168287607MaRDI QIDQ896001FDOQ896001
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
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Graph Theory and Probability
- S-functions for graphs
- Graph minors. III. Planar tree-width
- Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes
- Minimal completely separating systems
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
Cited In (11)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time
- Separating tree-chromatic number from path-chromatic number
- Treewidth versus clique number. II: Tree-independence number
- Title not available (Why is that?)
- Title not available (Why is that?)
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- Entire chromatic number of 1-tree.
- Orthogonal Tree Decompositions of Graphs
- Notes on tree- and path-chromatic number
- Bounded-diameter tree-decompositions
- Enumeration of equicolorable trees
Recommendations
- Title not available (Why is that?) 👍 👎
- Chromatic polynomials of generalized trees 👍 👎
- Chromaticity of two-trees 👍 👎
- On the chromatic number of tree graphs 👍 👎
- Chromatic number and subtrees of graphs 👍 👎
- Total chromatic sum for trees 👍 👎
- Notes on tree- and path-chromatic number 👍 👎
- Enumeration of equicolorable trees 👍 👎
- On the Locating Chromatic Number of Trees 👍 👎
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)
