On Hamiltonicity of 3-Connected Claw-Free Graphs

Lai, Shao and Zhan (J Graph Theory 48:142–146, 2005 ) showed that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. In this paper, we generalize this result and show that every 3-connected claw-free graph G such that every locally disconnected vertex lies on some induced cycle...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2014-09, Vol.30 (5), p.1261-1269
Hauptverfasser:	Tian, Runli, Xiong, Liming, Niu, Zhaohong
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorial analysis Combinatorics Disengaging Engineering Design Graph theory Graphs Mathematics Mathematics and Statistics Original Paper Triangles
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!