Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2013-09-01

Journal: GRAPHS AND COMBINATORICS

Included Journals: Scopus、SCIE

Volume: 29

Issue: 5

Page Number: 1259-1267

ISSN: 0911-0119

Key Words: Locally n-connected; Quasilocally 2-connected; Hamilton-connected

Abstract: If every vertex cut of a graph G contains a locally 2-connected vertex, then G is quasilocally 2-connected. In this paper, we prove that every connected quasilocally 2-connected claw-free graph is Hamilton-connected.