|
Organizers |
Vizing's Independence Number Conjecture of Critical Graphs
by
Rong Luo
Middle Tennessee State University
Coauthors: Yue Zhao, University of Central Florida
A graph of maximum degree D is D-critical if its edge chromatic number is D+ 1 and the edge chromatic number of any proper subgraph is at most D. In 1968, Vizing conjectured that if a graph G is a D-critical graph with n vertices, then the independence number a(G) < = n/2. In this talk, I will talk about some recent results about this conjecture.
Date received: April 18, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-51.