المؤلفون: Lamač, Jan, Vlasák, Miloslav

مصطلحات موضوعية: keyword:cycle cover, keyword:2-factor, keyword:Hamiltonian cycle, keyword:incidence matrix, keyword:least-square method, msc:05C38, msc:05C50, msc:93E24

وصف الملف: application/pdf

الاتاحة: http://hdl.handle.net/10338.dmlcz/703192

المؤلفون: An, Mingqiang, Xiong, Liming, Tian, Runli

مصطلحات موضوعية: keyword:claw-free graph, keyword:2-factor, keyword:closure, keyword:locally disconnected vertex, keyword:singular edge, msc:05C35, msc:05C38, msc:05C45

وصف الملف: application/pdf

Relation: mr:MR3360428; zbl:Zbl 06486948; reference:[1] Bielak, H.: Sufficient condition for Hamiltonicity of $N_{2}$-locally connected claw-free graphs.Discrete Math. 213 (2000), 21-24. Zbl 0951.05069, MR 1755406, 10.1016/S0012-365X(99)00163-6; reference:[2] Bondy, J. A., Murty, U. S. R.: Graph Theory with Applications.American Elsevier Publishing Co. New York (1976). MR 0411988; reference:[3] Choudum, S. A., Paulraj, M. S.: Regular factors in $K_{1, 3}$-free graphs.J. Graph Theory 15 (1991), 259-265. MR 1111989, 10.1002/jgt.3190150304; reference:[4] Egawa, Y., Ota, K.: Regular factors in $K_{1, n}$-free graphs.J. Graph Theory 15 (1991), 337-344. MR 1111995, 10.1002/jgt.3190150310; reference:[5] Faudree, J. R., Faudree, R. J., Ryjáček, Z.: Forbidden subgraphs that imply 2-factors.Discrete Math. 308 (2008), 1571-1582. Zbl 1139.05049, MR 2392597; reference:[6] Gould, R. J., Hynds, E. A.: A note on cycles in 2-factors of line graphs.Bull. Inst. Comb. Appl. 26 (1999), 46-48. Zbl 0922.05046, MR 1683819; reference:[7] Li, M.: Hamiltonian cycles in $N^{2}$-locally connected claw-free graphs.Ars Comb. 62 (2002), 281-288. MR 1881966; reference:[8] Oberly, D. J., Sumner, D. P.: Every connected, locally connected nontrivial graph with no induced claw is Hamiltonian.J. Graph Theory 3 (1979), 351-356. MR 0549691, 10.1002/jgt.3190030405; reference:[9] Pfender, F.: Hamiltonicity and forbidden subgraphs in 4-connected graphs.J. Graph Theory 49 (2005), 262-272. Zbl 1068.05042, MR 2197229, 10.1002/jgt.20080; reference:[10] Ryjáček, Z.: On a closure concept in claw-free graphs.J. Comb. Theory, Ser. B 70 (1997), 217-224. MR 1459867, 10.1006/jctb.1996.1732; reference:[11] Ryjáček, Z.: Hamiltonian circuits in $N_{2}$-locally connected $K_{1,3}$-free graphs.J. Graph Theory 14 (1990), 321-331. MR 1060860, 10.1002/jgt.3190140305; reference:[12] Ryjáček, Z., Saito, A., Schelp, R. H.: Closure, 2-factors and cycle coverings in claw-free graphs.J. Graph Theory 32 (1999), 109-117. Zbl 0932.05045, MR 1709653, 10.1002/(SICI)1097-0118(199910)32:23.0.CO;2-O; reference:[13] Ryjáček, Z., Xiong, L., Yoshimoto, K.: Closure concept for 2-factors in claw-free graphs.Discrete Math. 310 (2010), 1573-1579. Zbl 1225.05208, MR 2601267, 10.1016/j.disc.2010.02.004; reference:[14] Tian, R., Xiong, L.: Hamiltonian claw-free graphs with locally disconnected vertices.(to appear) in Discrete Math. DOI:10.1016/j.disc.2015.04.020. 10.1016/j.disc.2015.04.020; reference:[15] Yoshimoto, K.: On the number of components in 2-factors of claw-free graphs.Discrete Math. 307 (2007), 2808-2819. Zbl 1129.05037, MR 2362964, 10.1016/j.disc.2006.11.022

الاتاحة: http://hdl.handle.net/10338.dmlcz/144271

المؤلفون: An, Mingqiang, Lai, Hong-Jian, Li, Hao, Su, Guifu, Tian, Runli, Xiong, Liming

مصطلحات موضوعية: keyword:2-factor, keyword:claw-free graph, keyword:line graph, keyword:$N^{2}$-locally connected, msc:05C35, msc:05C38, msc:05C45

وصف الملف: application/pdf

Relation: mr:MR3304796; zbl:Zbl 06433712; reference:[1] Bondy, J. A., Murty, U. S. R.: Graph Theory with Applications.American Elsevier Publishing Co. New York (1976). MR 0411988; reference:[2] Choudum, S. A., Paulraj, M. S.: Regular factors in $K_{1, 3}$-free graphs.J. Graph Theory 15 (1991), 259-265. MR 1111989, 10.1002/jgt.3190150304; reference:[3] Egawa, Y., Ota, K.: Regular factors in $K_{1, n}$-free graphs.J. Graph Theory 15 (1991), 337-344. MR 1111995, 10.1002/jgt.3190150310; reference:[4] Gould, R. J., Hynds, E. A.: A note on cycles in 2-factors of line graphs.Bull. Inst. Comb. Appl. 26 (1999), 46-48. Zbl 0922.05046, MR 1683819; reference:[5] Li, G., Liu, Z.: On 2-factors in claw-free graphs.Syst. Sci. Math. Sci. 8 (1995), 369-372. Zbl 0851.05084, MR 1374533; reference:[6] Ryjáček, Z.: On a closure concept in claw-free graphs.J. Comb. Theory, Ser. B 70 (1997), 217-224. MR 1459867, 10.1006/jctb.1996.1732; reference:[7] Ryjáček, Z., Saito, A., Schelp, R. H.: Closure, 2-factors, and cycle coverings in claw-free graphs.J. Graph Theory 32 (1999), 109-117. Zbl 0932.05045, MR 1709653, 10.1002/(SICI)1097-0118(199910)32:23.0.CO;2-O; reference:[8] Tian, R., Xiong, L., Niu, Z.: On 2-factors in claw-free graphs whose edges are in small cycles.Discrete Math. 312 (2012), 3140-3145. Zbl 1251.05145, MR 2957934, 10.1016/j.disc.2012.07.005; reference:[9] Yoshimoto, K.: On the number of components in 2-factors of claw-free graphs.Discrete Math. 307 (2007), 2808-2819. Zbl 1129.05037, MR 2362964, 10.1016/j.disc.2006.11.022

الاتاحة: http://hdl.handle.net/10338.dmlcz/144159