On the size of edge chromatic critical graphs

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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).

Author supplied keywords

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free