arXiv Open Access 2015

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

Richard Lang

Lihat Sumber

Abstrak

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

math.CO

Richard Lang

APA MLA BibTeX

Lang, R. (2015). A note on total and list edge-colouring of graphs of tree-width 3. https://arxiv.org/abs/1504.05252

Lihat di Sumber

Informasi Jurnal