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

2015/04/08 by Richard Lang, Lang, Richard · 1 citation
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.02122

arxiv created 2015/04/08 · openalex publication_date 2015/04/08 · arxiv updated 2015/04/10 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

Among other results, it is shown that 3-trees are Δ-edge-choosable and that graphs of tree-width 3 and maximum degree at least 7 are Δ-edge-choosable.

Cited by

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

Related

• A note on total and list edge-colouring of graphs of tree-width 3
• 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
• Chromatic index, treewidth and maximum degree
• Conflict-free chromatic index of trees