Tree-coloring problems of bounded treewidth graphs
DOI10.1007/S10878-019-00461-7zbMATH Open1434.05055OpenAlexW2980611413WikidataQ126992706 ScholiaQ126992706MaRDI QIDQ2292136FDOQ2292136
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) 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)
Cites Work
- A partial k-arboretum of graphs with bounded treewidth
- Equitable partition of graphs into induced forests
- Equitable vertex arboricity of graphs
- The Point-Arboricity of Planar Graphs
- Acyclic colorings of planar graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Critical Point-Arboritic Graphs
- Equitable colorings of planar graphs without short cycles
- Equitable Coloring
- On the complexity of some colorful problems parameterized by treewidth
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Equitable coloring of graph product
- On Equitable Coloring of d-Degenerate Graphs
- Confronting intractability via parameters
- A \(c^k n\) 5-approximation algorithm for treewidth
- Equitable colorings of bounded treewidth graphs
- Interval vertex-coloring of a graph with forbidden colors
- Equitable vertex arboricity of 5-degenerate graphs
Cited In (18)
- Theoretical aspects of equitable partition of networks into sparse modules
- Equitable colorings of bounded treewidth graphs
- More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
- Complexity of tree-coloring interval graphs equitably
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy
- Equitable partition of plane graphs with independent crossings into induced forests
- \(H\)-free coloring on graphs with bounded tree-width
- Extremal problems on detectable colorings of trees
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
- Minimum conflict free colouring parameterized by treewidth
- On the Complexity of Some Colorful Problems Parameterized by Treewidth
- On the complexity of some colorful problems parameterized by treewidth
- On an extremal problem for colored trees
- Title not available (Why is that?)
- On digraph coloring problems and treewidth duality
- What makes equitable connected partition easy
This page was built for publication: Tree-coloring problems of bounded treewidth graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292136)
