Edge coloring of graphs with small maximum degrees

DOI10.1016/J.DISC.2008.07.006zbMath1213.05092OpenAlexW1982551929MaRDI QIDQ1044957

Shuchao Li, Xue-Chao Li

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.006

zbMATH Keywords

critical graphedge chromatic number

Mathematics Subject Classification ID

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

Related Items (5)

REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 ⋮ On the size of critical graphs with small maximum degree ⋮ Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees ⋮ On the size of critical graphs with maximum degree 8 ⋮ A sufficient condition for an IC-planar graph to be class 1

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic index critical graphs of order 9
• On small graphs critical with respect to edge colourings
• Chromatic-index-critical graphs of orders 11 and 12
• Remarks on the size of critical edge-chromatic graphs
• Edge coloring of graphs with small average degrees
• The size of edge chromatic critical graphs with maximum degree 6
• New lower bounds for the size of edge chromatic critical graphs
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Edge coloring of graphs with small maximum degrees