A note on total and list edge-colouring of graphs of tree-width 3

preprint2015arXivOpen access

It is shown that Halin graphs are $Δ$ -edge-choosable and that graphs of tree-width 3 are $(Δ+1)$ -edge-choosable and $(Δ+2)$ -total-colourable.

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract