𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian Connectedness in Claw-Free Graphs

✍ Scribed by MingChu Li

Book ID
106047992
Publisher
Springer Japan
Year
2000
Tongue
English
Weight
115 KB
Volume
16
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On hamiltonian claw-free graphs
On hamiltonian claw-free graphs
✍ E. Flandrin; J.L. Fouquet; H. Li πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 515 KB

We show that every 3-connected claw-free graphs having at most 5S-10 vertices is hamiltonian, where 6 is the minimum degree. For regular 3-connected claw-free graphs, a related result was obtained by Li and Liu (preprint), but for nonregular claw-free graphs the best-known result comes from the work

Hamiltonian cycles in 3-connected claw-f
Hamiltonian cycles in 3-connected claw-free graphs
✍ MingChu Li πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 437 KB πŸ‘ 2 views

## Abstract In this paper, we show that every 3‐connected claw‐free graph on n vertices with Ξ΄ β‰₯ (__n__ + 5)/5 is hamiltonian. Β© 1993 John Wiley & Sons, Inc.

Hamiltonian cycles in 2-connected claw-f
Hamiltonian cycles in 2-connected claw-free-graphs
✍ Hao Li πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 418 KB πŸ‘ 2 views

## Abstract M. Matthews and D. Sumner have proved that of __G__ is a 2‐connected claw‐free graph of order __n__ such that Ξ΄ ≧ (__n__ βˆ’ 2)/3, then __G__ is hamiltonian. We prove that the bound for the minimum degree Ξ΄ can be reduced to __n__/4 under the additional condition that __G__ is not in __F_