Please help support CiteULike by taking part in our marketing survey.
CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Hamilton connectivity of line graphs and claw-free graphs

by: Zhiquan Hu, Feng Tian, Bing Wei
Journal of Graph Theory, Vol. 50, No. 2. (2005), pp. 130-141.

X 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. © 2005 Wiley Periodicals, Inc. J Graph Theory

View the full article here:

DOI, Wiley InterScience

This article has been bookmarked once, on 2007-11-02.

2007-11-02 User kazuyah
Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.