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

DOI10.1007/s00373-015-1617-3zbMath1338.05087arXiv1504.05252OpenAlexW1489471257MaRDI QIDQ293637

Richard Lang

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.05252

zbMATH Keywords

total coloringHalin graphslist edge-coloringtree-width 3

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List-colourings of graphs
• A partial k-arboretum of graphs with bounded treewidth
• The total chromatic number of any multigraph with maximum degree five is at most seven
• List edge-colorings of series-parallel graphs
• The list chromatic index of a bipartite multigraph
• On the total coloring of certain graphs
• List edge colourings of some 1-factorable multigraphs

This page was built for publication: A note on total and list edge-colouring of graphs of tree-width 3