List Edge-Coloring and Total Coloring in Graphs of Low Treewidth

DOI10.1002/jgt.21874zbMath1339.05114arXiv1311.2969OpenAlexW2144392803MaRDI QIDQ2800543

Henning Bruhn, Richard Lang, Maya Jakobine Stein

Publication date: 15 April 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

tree widthtotal colouringlist colouring

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (6)

The parameterised complexity of list problems on graphs of bounded treewidth ⋮ Total colorings-a survey ⋮ On the linear arboricity of graphs with treewidth at most four ⋮ Chromatic index, treewidth and maximum degree ⋮ Chromatic index, treewidth and maximum degree ⋮ Neighbor sum distinguishing total coloring of graphs with bounded treewidth

Cites Work

• Unnamed Item
• The average degree of a multigraph critical with respect to edge or total choosability
• List-colourings of graphs
• A bound on the total chromatic number
• The total chromatic number of any multigraph with maximum degree five is at most seven
• List edge and list total colourings of multigraphs
• List edge-colorings of series-parallel graphs
• The list chromatic index of a bipartite multigraph
• Total colorings of degenerate graphs
• Edge-Coloring Partialk-Trees
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: List Edge-Coloring and Total Coloring in Graphs of Low Treewidth