The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition
暂无分享,去创建一个
[1] W. T. Tutte. A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.
[2] G. Chartrand,et al. Graphs & Digraphs , 1986 .
[3] Akira Saito,et al. Chvátal-Erdős Theorem: Old Theorem with New Aspects , 2008, KyotoCGGT.
[4] J. A. Bondy,et al. Graph Theory , 2008, Graduate Texts in Mathematics.
[5] Paul Erdös,et al. A note on Hamiltonian circuits , 1972, Discret. Math..
[6] Jun Fujisawa,et al. The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity , 2011, J. Graph Theory.
[7] David P. Sumner,et al. Every connected, locally connected nontrivial graph with no induced claw is hamiltonian , 1979, J. Graph Theory.