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

2015/04/20 by Richard Lang, Lang, Richard
Computer Science · Mathematics · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #acm:05C15 #math.CO #msc:05C15

paper · pdf · doi:10.48550/arxiv.1504.05252

arXiv admin note: substantial text overlap with arXiv:1504.02122

openalex publication_date 2015/04/20 · arxiv created 2015/07/29 · arxiv updated 2015/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Citations

• On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7

Related

• On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7
• List edge-colouring and total colouring in graphs of low treewidth
• Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
• Tools for parsimonious edge-colouring of graphs with maximum degree three
• List star edge coloring of generalized Halin graphs