Pages that link to "Item:Q2800543"
From MaRDI portal
The following pages link to List Edge-Coloring and Total Coloring in Graphs of Low Treewidth (Q2800543):
Displaying 5 items.
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- Chromatic index, treewidth and maximum degree (Q5892299) (← links)
- Chromatic index, treewidth and maximum degree (Q5916063) (← links)
- On the linear arboricity of graphs with treewidth at most four (Q6172210) (← links)
