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 10 items.
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- 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)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389) (← links)
- Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs (Q3559384) (← links)
- Efficiently list-edge coloring multigraphs asymptotically optimally (Q5146931) (← 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)