On connected factors inK 1,3-free graphs
Tóm tắt
A graph is said to beK
1,3-free if it contains noK
1,3 as an induced subgraph. It is shown in this paper that every 2-connectedK
1,3-free graph contains a connected [2,3]-factor. We also obtain that every connectedK
1,3-free graph has a spanning tree with maximum degree at most 3.
Tài liệu tham khảo
J.A. Bondy and U.S.R. Murty. Graph Theory with Applications The MacMillan Press, London, 1976.
D.J. Oberly and D.P. Summer. Every Connected Locally Connected Nontrivial Graph with No Induced Claw is Hamiltonian.J. Graph Theory, 1979, 3: 351–356.
Z. Ryjacek. Factors and Circuits inK 1,3-free Graphs, Combinatorics and Graph Theory. Banach Center Publications, 1989, 25: 137–145.
S.A. Choudum and M.S. Paulraj. Regular Factors inK 1,3-Free Graphs.J. Graph Theory, 1991, 15: 259–265.
M.M. Matthews and D.P. Summer. Hamiltonian Results inK 1,3-Free Graphs.J. Graph Theory, 1984, 8: 139–146.
H. Li and Z.H. Liu. On The Connected [a,b]-Factors in Claw-Free Graphs. Preprint.
M. Kano. Some Current Results and Problems on Factors of Graphs. In Proc. 3rd China-USA Internat. Conf. on Graph Theory and Its Applications, Beijing, 1993.
M. Kano and G.J. Li. On Spanning Tree inK 1,n -free Graphs. Preprint.