The Size of Edge Chromatic Critical Graphs with Maximum Degree 6

Authors

Authors

R. Luo; L. Y. Miao;Y. Zhao

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abstract

In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117-134; Russian Math Surveys 23 (1968), 125-142] conjectured that for any edge chromatic critical graph G = (V, E) with maximum degree Delta, vertical bar E vertical bar > = 1/2 {(Delta-1)vertical bar V vertical bar + 3}. This conjecture has been verified for Delta < = 5. In this article, by applying the discharging method, we prove the conjecture for Delta = 6. (C) 2008 Wiley Periodicals, Inc. J Graph Theory 60: 149-171, 2009

Journal Title

Journal of Graph Theory

Volume

60

Issue/Number

2

Publication Date

1-1-2009

Document Type

Article

DOI Link

http://dx.doi.org/10.1002/jgt.2035

First Page

149

Last Page

171

WOS Identifier

WOS:000262324800004

ISSN

0364-9024

Recommended Citation

"The Size of Edge Chromatic Critical Graphs with Maximum Degree 6" (2009). Faculty Bibliography 2000s. 1839.
https://stars.library.ucf.edu/facultybib2000/1839