Title
An application of Vizing and Vizing-like adjacency lemmas to Vizing's Independence Number Conjecture of edge chromatic critical graphs
Abbreviated Journal Title
Discret. Math.
Keywords
Edge coloring; Independence number; Critical graphs; Mathematics
Abstract
In 1968, Vizing conjectured that, if G is a A-critical graph with n vertices, then alpha(G) < = n/2 where alpha(G) is the independence number of G. In this note, we apply Vizing and Vizing-like adjacency lemmas to this problem and obtain better bounds for Delta is an element of {7,..., 19}. (C) 2008 Elsevier B.V. All rights reserved.
Journal Title
Discrete Mathematics
Volume
309
Issue/Number
9
Publication Date
1-1-2009
Document Type
Article
Language
English
First Page
2925
Last Page
2929
WOS Identifier
ISSN
0012-365X
Recommended Citation
"An application of Vizing and Vizing-like adjacency lemmas to Vizing's Independence Number Conjecture of edge chromatic critical graphs" (2009). Faculty Bibliography 2000s. 1840.
https://stars.library.ucf.edu/facultybib2000/1840
Comments
Authors: contact us about adding a copy of your work at STARS@ucf.edu