Hamiltonian cycles in 3-connected Claw-free graphs

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

It is shown that every 3-connected claw-free graph having at most 6(5 -7 vertices is hamiltonian, where <5 is the minimum degree. ©2002 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Li, G., Lu, M., & Liu, Z. (2002). Hamiltonian cycles in 3-connected Claw-free graphs. Discrete Mathematics, 250(1–3), 137–151. https://doi.org/10.1016/S0012-365X(01)00279-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free