ON CONNECTED FACTORS IN K1,3-FREE GRAPHS

被引：0
|
作者：
李国君
刘振宏
机构：
来源：
Acta Mathematicae Applicatae Sinica(English Series) | 1998年 / 01期
关键词：
K1; 3-free graph; connected [2; 3]-factor;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
A graph is said to be K1,3-free if it contains no K1,3 as an induced subgraph. It is shown in this paper that every 2-connected K1,3-free graph contains a connected [2,3]-factor. We also obtain that every connected K1,3-free graph has a spanning tree with maximum degree at most 3.
引用
收藏
页码：43 / 47
页数：5
相关论文
共 50 条
12345