Title
On The Size Of Edge Chromatic Critical Graphs
Keywords
Chromatic number; Class one; Class two
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).
Publication Date
1-1-2002
Publication Title
Journal of Combinatorial Theory. Series B
Volume
86
Issue
2
Number of Pages
408-412
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1006/jctb.2002.2135
Copyright Status
Unknown
Socpus ID
0036847445 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/0036847445
STARS Citation
Sanders, Daniel P. and Zhao, Yue, "On The Size Of Edge Chromatic Critical Graphs" (2002). Scopus Export 2000s. 2800.
https://stars.library.ucf.edu/scopus2000/2800