𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for oriented graphs to be Hamiltonian

✍ Scribed by Odile Favaron; Oscar Ordaz

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
492 KB
Volume
58
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ 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.

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

A sufficient condition for a semicomplet
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
✍ JΓΈrgen Bang-Jensen; Gregory Gutin; Jing Huang πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 670 KB

A multipartite tournament is an orientation of a complete k-partite graph for some k >~ 2. A factor of a digraph D is a collection of vertex disjoint cycles covering all the vertices of D. We show that there is no degree of strong connectivity which together with the existence of a factor will guara

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.