Title of article
On 1-Hamilton-connected claw-free graphs
Author/Authors
Kaiser، نويسنده , , Tom?? and Ryj??ek، نويسنده , , Zden?k and Vr?na، نويسنده , , Petr، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
11
From page
1
To page
11
Abstract
A graph G is k -Hamilton-connected ( k -hamiltonian) if G − X is Hamilton-connected (hamiltonian) for every set X ⊂ V ( G ) with | X | = k . In the paper, we prove that (i)
5-connected claw-free graph with minimum degree at least 6 is 1-Hamilton-connected,
4-connected claw-free hourglass-free graph is 1-Hamilton-connected.
byproduct, we also show that every 5-connected line graph with minimum degree at least 6 is 3-hamiltonian.
Keywords
Hourglass-free , Closure , Hamilton-connected , claw-free , Line graph
Journal title
Discrete Mathematics
Serial Year
2014
Journal title
Discrete Mathematics
Record number
1600599
Link To Document