An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree

DOI10.1016/S0012-365X(03)00290-5zbMath1032.05054MaRDI QIDQ1408892

Shi-you Pang, Lian-Ying Miao, Jian Liang Wu

Publication date: 25 September 2003

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

zbMATH Keywords

edge coloringcritical graphedge chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the size of edge-coloring critical graphs with maximum degree 4

Cites Work

• Unnamed Item
• Unnamed Item
• On graphs critical with respect to edge-colourings
• Edge-coloring critical graphs with high degree
• Coloring edges of embedded graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree