Show simple item record

dc.contributor.authorYang, Weihuazh_CN
dc.contributor.authorLai, Hong-Jianzh_CN
dc.contributor.authorLi, Haozh_CN
dc.contributor.authorGuo, Xiaofengzh_CN
dc.contributor.author杨卫华zh_CN
dc.date.accessioned2015-07-22T03:21:21Z
dc.date.available2015-07-22T03:21:21Z
dc.date.issued2014 MARzh_CN
dc.identifier.citationGRAPHS AND COMBINATORICS, 2014,30(2):501-510zh_CN
dc.identifier.otherWOS:000331652600020zh_CN
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/89373
dc.descriptionNSFC [11171279]zh_CN
dc.description.abstractThomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai (Combinatorics and Graph Theory, vol 95, World Scientific, Singapore, pp 53-69; Conjecture 8.6 of 1995) conjectured that every 3-edge connected and essentially 6-edge connected graph is collapsible. Denote D (3)(G) the set of vertices of degree 3 of graph G. For , define d(e) = d(u) + d(v) - 2 the edge degree of e, and . Denote by lambda (m) (G) the m-restricted edge-connectivity of G. In this paper, we prove that a 3-edge-connected graph with , and is collapsible; a 3-edge-connected simple graph with , and is collapsible; a 3-edge-connected graph with , , and with at most 24 vertices of degree 3 is collapsible; a 3-edge-connected simple graph with , and with at most 24 vertices of degree 3 is collapsible; a 3-edge-connected graph with , and with at most 9 vertices of degree 3 is collapsible. As a corollary, we show that a 4-connected line graph L(G) with minimum degree at least 5 and is Hamiltonian.zh_CN
dc.language.isoen_USzh_CN
dc.publisherSPRINGER JAPAN KKzh_CN
dc.source.urihttp://dx.doi.org/10.1007/s00373-012-1280-xzh_CN
dc.subjectCLAW-FREE GRAPHSzh_CN
dc.subjectCONNECTIVITYzh_CN
dc.titleCollapsible Graphs and Hamiltonicity of Line Graphszh_CN
dc.typeArticlezh_CN


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record