|
|||||
|
|
Toughness, degrees and 2-factors |
|
| Authors: | Ralph J. Faudree Ronald J. Gould Michael S. Jacobson Linda Lesniak |
| Affiliation: | a University of Memphis, Memphis, TN 38152, USA b Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA c Department of Mathematics, University of Colorado at Denver, Denver, CO 80217, USA d Department of Mathematics, Drew University, Madison, NJ 07940, USA e Department of Computer Science and Information and Science, Nihon University, Tokyo 156, Japan |
| Abstract: | In this paper we generalize a Theorem of Jung which shows that 1-tough graphs with  are hamiltonian. Our generalization shows that these graphs contain a wide variety of 2-factors. In fact, these graphs contain not only 2-factors having just one cycle (the hamiltonian case) but 2-factors with k cycles, for any k such that  . |
| Keywords: | 05C38 05C45 |
| 本文献已被 ScienceDirect 等数据库收录！ | |