6-FACTORS IN 2-CONNECTED STAR-FREE GRAPHS

被引：0
|
作者：
Yashima, Takamasa [1 ]
机构：
[1] Tokyo Univ Sci, Dept Math Informat Sci, Shinjuku Ku, Tokyo 1628601, Japan
来源：
AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2014年 / 11卷 / 01期
关键词：
graph; regular factor;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let t >= 3 be an integer and G be a 2-connected K-1,K-t-free graph. We show that if t >= 4 and minimum degree of G is at least 2t +1, then G has a 6-factor. We also show that if t = 3 and minimum degree of G is at least 8, then G has a 6-factor.
引用
收藏
页码：1 / 12
页数：12
相关论文
共 7 条
1