On the size of critical graphs with maximum degree 8

DOI10.1016/j.disc.2010.04.010zbMath1225.05143OpenAlexW2062919131MaRDI QIDQ982631

Qingbo Sun, Lian-Ying Miao

Publication date: 7 July 2010

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

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

zbMATH Keywords

average degreecritical graphedge chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

An introduction to the discharging method via graph coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Sizes of critical graphs with small maximum degrees
• Edge coloring of graphs with small maximum degrees
• On critical graphs with chromatic index 4
• On the size of edge-chromatic critical graphs
• Remarks on the size of critical edge-chromatic graphs
• Edge coloring of graphs with small average degrees
• Planar graphs of maximum degree seven are Class I
• The size of edge chromatic critical graphs with maximum degree 6
• Some remarks on a paper by Vizing on critical graphs
• New lower bounds for the size of edge chromatic critical graphs
• The average degree of an edge‐chromatic critical graph II
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: On the size of critical graphs with maximum degree 8