Title of article
Hamiltonicity of 3-connected quasi-claw-free graphs
Author/Authors
Rao Li، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
7
From page
393
To page
399
Abstract
A graph G is called quasi-claw-free if it satisfies the property: d(x,y)=2⇒ there exists u∈N(x)∩N(y) such that N[u]⊆N[x]∪N[y]. Let G be a 3-connected quasi-claw-free graph of order n. If δ(G)⩾(n+5)/5, then G is hamiltonian.
Keywords
Quasi-claw-free graphs , Claw-free graphs , Hamiltonicity
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949108
Link To Document