Tree-coloring problems of bounded treewidth graphs

DOI10.1007/s10878-019-00461-7zbMath1434.05055OpenAlexW2980611413WikidataQ126992706 ScholiaQ126992706MaRDI QIDQ2292136

Bi Li, Xin Zhang

Publication date: 3 February 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00461-7

zbMATH Keywords

bounded treewidthtree-coloringequitable tree-coloringNice tree decomposition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Hardness and algorithms of equitable tree-coloring problem in chordal graphs ⋮ Equitable vertex arboricity conjecture holds for graphs with low degeneracy ⋮ Theoretical aspects of equitable partition of networks into sparse modules ⋮ Complexity of tree-coloring interval graphs equitably ⋮ Equitable partition of plane graphs with independent crossings into induced forests ⋮ More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints

Cites Work

• Unnamed Item
• Equitable vertex arboricity of graphs
• Confronting intractability via parameters
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• On the complexity of some colorful problems parameterized by treewidth
• Equitable colorings of bounded treewidth graphs
• A partial k-arboretum of graphs with bounded treewidth
• Interval vertex-coloring of a graph with forbidden colors
• Equitable colorings of planar graphs without short cycles
• Equitable partition of graphs into induced forests
• Equitable vertex arboricity of 5-degenerate graphs
• A $c^k n$ 5-Approximation Algorithm for Treewidth
• Graph minors. II. Algorithmic aspects of tree-width
• Critical Point-Arboritic Graphs
• Equitable Coloring
• On Equitable Coloring of d-Degenerate Graphs
• The Point-Arboricity of Planar Graphs
• Acyclic colorings of planar graphs

This page was built for publication: Tree-coloring problems of bounded treewidth graphs