✦ LIBER ✦

The number of cycles in a hamilton graph

✍ Scribed by Yongbing Shi

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 523 KB
Volume: 133
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90031-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of hamilton cycles in a ra

On the number of hamilton cycles in a random graph

✍ C. Cooper; A. M. Frieze 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 576 KB

Let a random graph G be constructed by adding random edges one by one, starting with n isolated vertices. We show that with probability going to one as n goes to infinity, when G first has minimum degree two, it has at least (log n)('-')" distinct hamilton cycles for any fixed E > 0.

Disjoint Hamilton cycles in the random g

Disjoint Hamilton cycles in the random geometric graph

✍ Tobias Müller,; Xavier Pérez-Giménez;; Nicholas Wormald 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB

We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge-length. For fixed k ≥ 1, we prove that the first edge in the process that creates a k-connected graph coincides a.a.s. with

Hamilton cycles in regular graphs

✍ Bill Jackson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## UNIVERSIW OF WATERLOO ' The research reported here has been sponsored by the Canadian Commonwealth Association.

On the maximum number of cycles in a pla

On the maximum number of cycles in a planar graph

✍ R. E. L. Aldred; Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

## Abstract Let __G__ be a graph on __p__ vertices with __q__ edges and let __r__ = __q__ − __p__ = 1. We show that __G__ has at most ${15\over 16} 2^{r}$ cycles. We also show that if __G__ is planar, then __G__ has at most 2^__r__ − 1^ = __o__(2^__r__ − 1^) cycles. The planar result is best possib

Edge disjoint Hamilton cycles in graphs

✍ Guojun Li 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

Hamilton cycles in claw-free graphs

✍ Cun-Quan Zhang 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 2 views