Chromatic index, treewidth and maximum degree

DOI10.1016/j.endm.2016.09.045zbMath1356.05047arXiv1603.05018OpenAlexW2808209633MaRDI QIDQ5892299

Laura Gellert, Henning Bruhn, Richard Lang

Publication date: 13 February 2017

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

treewidthedge-colouringfractional colouring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A partial k-arboretum of graphs with bounded treewidth
• List edge and list total colourings of multigraphs
• List edge-colorings of series-parallel graphs
• Planar graphs of maximum degree seven are Class I
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Total colorings of degenerate graphs
• List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
• Edge-Coloring Partialk-Trees
• The NP-Completeness of Edge-Coloring
• Total colorings of planar graphs with large maximum degree
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Chromatic index, treewidth and maximum degree