Edge-coloring critical graphs with high degree

DOI10.1016/S0012-365X(02)00395-3zbMath1007.05054OpenAlexW2074423918MaRDI QIDQ1850002

Lian-Ying Miao, Jian Liang Wu

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00395-3

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Edge coloring of planar graphs without adjacent 7-cycles ⋮ Edge colorings of planar graphs without 5-cycles with two chords ⋮ An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ Edge colorings of planar graphs without 6-cycles with three chords ⋮ The edge colorings of \(K_5\)-minor free graphs ⋮ On the size of edge-coloring critical graphs with maximum degree 4

This page was built for publication: Edge-coloring critical graphs with high degree