Toughness and the existence ofk-factors. II |
| |
| Authors: | Hikoe Enomoto |
| |
| Institution: | (1) Department of Information Science, Faculty of Science, University of Tokyo, Hongo, Bunkyo-ku, 113 Tokyo, Japan |
| |
| Abstract: | In a paper with the same title 3], we proved Chvátal's conjecture thatk-tough graphs havek-factors if they satisfy trivial necessary conditions. In this paper, we prove the following stronger result: Suppose|V(G)|  k + 1,k  |V(G)| even, and|S| k w(G – S) – 7/8k ifw(G – S) 2, wherew(G – S) is the number of connected components ofG – S. ThenG has ak-factor. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
