✦ LIBER ✦

A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs

✍ Scribed by X. Liu; B. Wei

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 337 KB
Volume: 169
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00323-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Four sufficient conditions for hamiltoni

Four sufficient conditions for hamiltonian graphs

✍ A. Ainouche 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 290 KB

## Ainouche, A., Four sufficient conditions for hamiltonian graphs, Discrete Mathematics 89 (1991) 195-200.

An improvement of fraisse's sufficient c

An improvement of fraisse's sufficient condition for hamiltonian graphs

✍ 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

A generalization of Fan's condition for

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

✍ P. Bedrossian; G. Chen; R.H. Schelp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 770 KB

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

A new sufficient condition for hamiltoni

A new sufficient condition for hamiltonian graphs

✍ Pierre Fraisse 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

Strong sufficient conditions for the exi

Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs

✍ Ahmed Ainouche; Nicos Christofides 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Sufficient conditions for a digraph to b

Sufficient conditions for a digraph to be Hamiltonian

✍ Bang-Jensen, J�rgen; Gutin, Gregory; Li, Hao 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB 👁 2 views

We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of nonadjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs