𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for a graph to contain two disjoint hamiltonian cycles

✍ Scribed by Sein Win

Book ID
112946513
Publisher
Vandenhoeck & Ruprecht
Year
1988
Tongue
German
Weight
386 KB
Volume
58
Category
Article
ISSN
0025-5858

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sufficient condition for a graph to co
A sufficient condition for a graph to contain three disjoint 1-factors
✍ Sein Win πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 1 views

## Abstract Ore derived a sufficient condition for a graph to contain a Hamiltonian cycle. We obtain a sufficient condition, similar to Ore's condition, for a graph to contain a Hamiltonian cycle and a 1‐factor which are edge disjoint.