In this paper, by applying the discharging method, we prove that if G = (V, E) is a Δ-critical graph, then E ≥1/4 V (Δ + √2Δ - 1). © 2002 Elsevier, Science (USA).
CITATION STYLE
Sanders, D. P., & Zhao, Y. (2002). On the size of edge chromatic critical graphs. Journal of Combinatorial Theory. Series B, 86(2), 408–412. https://doi.org/10.1006/jctb.2002.2135
Mendeley helps you to discover research relevant for your work.