Hamilton connectivity of line graphs and claw-free graphs Export

@article{citeulike:1854936, abstract = {Let G be a graph and let V0 = {?? V(G): dG(?) = 6}. We show in this paper that: (i) if G is a 6-connected line graph and if |V0| ? 29 or G[V0] contains at most 5 vertex disjoint K4's, then G is Hamilton-connected; (ii) every 8-connected claw-free graph is Hamilton-connected. Several related results known before are generalized. {\copyright} 2005 Wiley Periodicals, Inc. J Graph Theory}, address = {Faculty of Mathematics and Statistics Central China Normal University Wuhan Hubei 430079, People's Republic of China; Institute of Systems Science Academy of Mathematics and Systems Sciences Chinese Academy of Sciences Beijing 100080, People's Republic of China; Department of Mathematics The University of Mississippi University, Mississippi 38677}, author = {Hu, Zhiquan and Tian, Feng and Wei, Bing}, citeulike-article-id = {1854936}, citeulike-linkout-0 = {http://dx.doi.org/10.1002/jgt.20099}, citeulike-linkout-1 = {http://www3.interscience.wiley.com/cgi-bin/abstract/110527153/ABSTRACT}, doi = {10.1002/jgt.20099}, journal = {Journal of Graph Theory}, keywords = {algorithm}, number = {2}, pages = {130--141}, posted-at = {2007-11-02 07:14:55}, priority = {4}, title = {Hamilton connectivity of line graphs and claw-free graphs}, url = {http://dx.doi.org/10.1002/jgt.20099}, volume = {50}, year = {2005} }

TY - JOUR ID - citeulike:1854936 L3 - citeulike-article-id:1854936 N2 - Let G be a graph and let V0 = {?? V(G): dG(?) = 6}. We show in this paper that: (i) if G is a 6-connected line graph and if |V0| ? 29 or G[V0] contains at most 5 vertex disjoint K4's, then G is Hamilton-connected; (ii) every 8-connected claw-free graph is Hamilton-connected. Several related results known before are generalized. © 2005 Wiley Periodicals, Inc. J Graph Theory IS - 2 JF - Journal of Graph Theory AD - Faculty of Mathematics and Statistics Central China Normal University Wuhan Hubei 430079, People's Republic of China; Institute of Systems Science Academy of Mathematics and Systems Sciences Chinese Academy of Sciences Beijing 100080, People's Republic of China; Department of Mathematics The University of Mississippi University, Mississippi 38677 EP - 141 TI - Hamilton connectivity of line graphs and claw-free graphs VL - 50 SP - 130 KW - algorithm AU - Hu, Zhiquan AU - Tian, Feng AU - Wei, Bing PY - 2005/// UR - http://dx.doi.org/10.1002/jgt.20099 ER -