Title
A Sufficient Condition for Edge Chromatic Critical Graphs to Be HamiltonianAn Approach to Vizing's 2-Factor Conjecture
Abbreviated Journal Title
J. Graph Theory
Keywords
edge colorings; critical graphs; 2-factors; Hamiltonian cycles; MAXIMUM DEGREE; INDEX; Mathematics
Abstract
In this article, we consider Vizing's 2-Factor Conjecture which claims that any -critical graph has a 2-factor, and show that if G is a -critical graph with n vertices satisfying 6n7, then G is Hamiltonian and thus G has a 2-factor. Meanwhile in this article, we also consider long cycles of overfull critical graphs and obtain that if G is an overfull -critical graph with n vertices, then the circumference of G is at least min{2,n}.(c) 2012 Wiley Periodicals, Inc. J. Graph Theory 00: 1-14, 2012
Journal Title
Journal of Graph Theory
Volume
73
Issue/Number
4
Publication Date
1-1-2013
Document Type
Article
DOI Link
Language
English
First Page
469
Last Page
482
WOS Identifier
ISSN
0364-9024
Recommended Citation
"A Sufficient Condition for Edge Chromatic Critical Graphs to Be HamiltonianAn Approach to Vizing's 2-Factor Conjecture" (2013). Faculty Bibliography 2010s. 4348.
https://stars.library.ucf.edu/facultybib2010/4348
Comments
Authors: contact us about adding a copy of your work at STARS@ucf.edu