Chromatic index, treewidth and maximum degree

zbMath1391.05102MaRDI QIDQ5916063

Henning Bruhn, Laura Gellert, Richard Lang

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p23

zbMATH Keywords

graph theorytree widthedge colouringfractional edge colouring

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (1)

Graph edge coloring: a survey

Cites Work

• A partial k-arboretum of graphs with bounded treewidth
• List edge and list total colourings of multigraphs
• List edge-colorings of series-parallel graphs
• On simple characterizations of k-trees
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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