科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this article, we consider Vizing%26apos;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}.
- 出版日期2013-8
