On the size of edge chromatic critical graphs

DOI10.1006/jctb.2002.2135zbMath1029.05062OpenAlexW2018313468MaRDI QIDQ1403929

Daniel P. Sanders, Yue Zhao

Publication date: 20 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2002.2135

zbMATH Keywords

chromatic numberclass oneclass two

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

A note on the size of edge-chromatic 4-critical graphs ⋮ Sizes of critical graphs with small maximum degrees ⋮ An introduction to the discharging method via graph coloring ⋮ The average degree of an edge-chromatic critical graph ⋮ Average degrees of edge-chromatic critical graphs ⋮ The average degree of a multigraph critical with respect to edge or total choosability ⋮ On the size of edge-coloring critical graphs with maximum degree 4 ⋮ The spectral radius of edge chromatic critical graphs

Cites Work

• On critical graphs with chromatic index 4
• On the size of edge-chromatic critical graphs
• Remarks on the size of critical edge-chromatic graphs
• Some remarks on a paper by Vizing on critical graphs
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item