Pages that link to "Item:Q2292136"
From MaRDI portal
The following pages link to Tree-coloring problems of bounded treewidth graphs (Q2292136):
Displaying 16 items.
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Minimum conflict free colouring parameterized by treewidth (Q779250) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Extremal problems on detectable colorings of trees (Q952656) (← links)
- On an extremal problem for colored trees (Q1279875) (← links)
- Theoretical aspects of equitable partition of networks into sparse modules (Q2031046) (← links)
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774) (← links)
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy (Q2230570) (← links)
- Equitable partition of plane graphs with independent crossings into induced forests (Q2305905) (← links)
- \(H\)-free coloring on graphs with bounded tree-width (Q2326574) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- (Q5245526) (← links)
