A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness

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

Abstract

A weakened version of Fan's condition for Hamiltonicity is shown to be sufficient for a 2-connected graph to be pancyclic (with a few exceptions). Also, a similar condition is shown to be sufficient for a 3-connected graph to be Hamiltonian-connected. These results generalize the earlier work of Benhocine and Wodja (1987). © 1993.

Cite

CITATION STYLE

APA

Bedrossian, P., Chen, G., & Schelp, R. H. (1993). A generalization of Fan’s condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness. Discrete Mathematics, 115(1–3), 39–50. https://doi.org/10.1016/0012-365X(93)90476-A

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