Pages that link to "Item:Q817768"
From MaRDI portal
The following pages link to Equitable colorings of bounded treewidth graphs (Q817768):
Displayed 5 items.
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Equitable coloring on total graph of bigraphs and central graph of cycles and paths (Q539352) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)