𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by P. Bedrossian; G. Chen; R.H. Schelp


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
770 KB
Volume
115
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


Bedrossian, P., G. Chen and R.H. &help, A generalization of Fan's condition of Hamiltonicity, pancyclicity, and Hamiltonian connectedness, Discrete Mathematics 115 (1993) 39-50.

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).

a pendant edge to some vertex of a triangle.


πŸ“œ SIMILAR VOLUMES


An improvement of fraisse's sufficient c
✍ A. Ainouche πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 567 KB

## Abstract Let __G__ be a __k__‐connected graph of order __n__. For an independent set c, let __d(S)__ be the number of vertices adjacent to at least one vertex of __S__ and > let i(S) be the number of vertices adjacent to at least |S| vertices of __S__. We prove that if there exists some s, 1 ≀ s