Toughness and the existence of k-factors. III

被引：19
作者：
Enomoto, H [1 ]
机构：
[1] Keio Univ, Dept Math, Kohoku Ku, Yokohama, Kanagawa 223, Japan
来源：
DISCRETE MATHEMATICS | 1998年 / 189卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(98)00059-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In a paper with the same title (Enomoto et al., 1985) we proved Chvatal's conjecture that k-tough graphs have k-factors if they satisfy trivial necessary conditions. In this paper, we introduce a variation of toughness, and prove a stronger result for the existence of 1- or 2-factors. This solves a conjecture of Liu and Yu, affirmatively. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：277 / 282
页数：6
相关论文
共 8 条
[1]  
Bollobas B., 1978, EXTREMAL GRAPH THEOR
[2]  
CAI MC, IN PRESS GRAPHS COMB
[3]  
CHARTRAND G, 1996, GRAPHS DIGRAPHS
[4]  
Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6
[5]   TOUGHNESS AND THE EXISTENCE OF K-FACTORS .2. [J].
ENOMOTO, H .
GRAPHS AND COMBINATORICS, 1986, 2 (01) :37-42
[6]   TOUGHNESS AND THE EXISTENCE OF K-FACTORS [J].
ENOMOTO, H ;
JACKSON, B ;
KATERINIS, P ;
SAITO, A .
JOURNAL OF GRAPH THEORY, 1985, 9 (01) :87-95
[7]  
LIU G, K FACTORS EXTENDABIL
[8]  
Plummer M.D., 1986, Matching theory
1