On factors of 4-connected claw-free graphs
暂无分享,去创建一个
[1] Siming Zhan,et al. On hamiltonian line graphs and connectivity , 1991, Discret. Math..
[2] F. Harary,et al. On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.
[3] Sukhamay Kundu,et al. Bounds on the number of disjoint spanning trees , 1974 .
[4] Matthias Kriesell,et al. All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected , 2001, J. Comb. Theory, Ser. B.
[5] Zdeněk Ryjáčk. On a Closure Concept in Claw-Free Graphs , 1997 .
[6] R. Schelp,et al. Closure, 2-factors, and cycle coverings in claw-free graphs , 1999 .
[7] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[8] Zdenek Ryjácek. On a Closure Concept in Claw-Free Graphs , 1997, J. Comb. Theory, Ser. B.
[9] Bill Jackson,et al. K-walks of Graphs , 1990, Australas. J Comb..
[10] Sho Ishizuka. Closure, Path-Factors and Path Coverings in Claw-Free Graphs , 1998, Ars Comb..
[11] Richard H. Schelp,et al. Closure, 2-factors, and cycle coverings in claw-free graphs , 1999, J. Graph Theory.
[12] David P. Sumner,et al. Hamiltonian results in K1, 3-free graphs , 1984, J. Graph Theory.
[13] Carsten Thomassen,et al. Reflections on graph theory , 1986, J. Graph Theory.
[14] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .