A note on the size of edge-chromatic 4-critical graphs

DOI10.1016/j.disc.2016.04.013zbMath1339.05123OpenAlexW2396225499MaRDI QIDQ294519

Jian Cheng, Joshua C. Thompson, Kate J. Lorenzen, Rong Luo

Publication date: 16 June 2016

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

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

zbMATH Keywords

edge coloringcritical graphsdischarging method

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the size of edge-coloring critical graphs with maximum degree 4
• On critical graphs with chromatic index 4
• On the size of edge-chromatic critical graphs
• On the size of edge chromatic critical graphs
• Coloring edges of graphs embedded in a surface of characteristic zero.
• Planar graphs of maximum degree seven are Class I
• Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
• The size of edge chromatic critical graphs with maximum degree 6
• The average degree of an edge‐chromatic critical graph II
• 25 pretty graph colouring problems
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: A note on the size of edge-chromatic 4-critical graphs