1097-0118/asset/JGT_left.gif?v=1&s=1444a0be416c8f041967dd96201bc2e34f807002)
New lower bounds for the size of edge chromatic critical graphs
Article first published online: 22 MAR 2004
DOI: 10.1002/jgt.10173
Copyright © 2004 Wiley Periodicals, Inc.
1097-0118/asset/cover.gif?v=1&s=747ee645df081de59c78864878c8bdb9daeca9a1 "Journal of Graph Theory")
Additional Information
How to Cite
Zhao, Y. (2004), New lower bounds for the size of edge chromatic critical graphs. Journal of Graph Theory, 46: 81–92. doi: 10.1002/jgt.10173
Publication History
- Issue published online: 7 APR 2004
- Article first published online: 22 MAR 2004
- Manuscript Revised: 7 OCT 2003
- Manuscript Received: 19 DEC 2000
Funded by
- National Science Foundation. Grant Number: DMS-0096160
- National Security Agency. Grant Number: MDA-904-02-1-0096
- Abstract
- References
- Cited By
Keywords:
- class one;
- class two;
- critical graphs;
- chromatic index
Abstract
In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Δ. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004