On Hamiltonian line graphs and connectivity
Discrete Mathematics
Graphs without spanning closed trails
Discrete Mathematics
On a closure concept in claw-free graphs
Journal of Combinatorial Theory Series B
Graph Theory With Applications
Graph Theory With Applications
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory Series B
Hamilton connectivity of line graphs and claw-free graphs
Journal of Graph Theory
Hamiltonian connectedness in 3-connected line graphs
Discrete Applied Mathematics
Hamilton cycles in 5-connected line graphs
European Journal of Combinatorics
Collapsible graphs and Hamiltonian connectedness of line graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
Let G be a graph and let D"6(G)={v@?V(G)|d"G(v)=6}. In this paper we prove that: (i) If G is a 6-connected claw-free graph and if |D"6(G)|@?74 or G[D"6(G)] contains at most 8 vertex disjoint K"4's, then G is Hamiltonian; (ii) If G is a 6-connected line graph and if |D"6(G)|@?54 or G[D"6(G)] contains at most 5 vertex disjoint K"4's, then G is Hamilton-connected.