𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Four sufficient conditions for hamiltonian graphs

✍ Scribed by A. Ainouche

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
290 KB
Volume
89
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Ainouche,

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

πŸ“œ SIMILAR VOLUMES

One sufficient condition for hamiltonian
One sufficient condition for hamiltonian graphs
✍ Guantao Chen πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 220 KB πŸ‘ 1 views

## Abstract Let __G__ be a 2‐connected graph of order __n.__ We show that if for each pair of nonadjacent vertices __x__,__y__ ∈ __V(G)__, then __G__ is Hamiltonian.

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