✦ LIBER ✦

Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree

✍ Scribed by Jackson, B.

Book ID: 120096679
Publisher: Oxford University Press
Year: 1979
Tongue: English
Weight: 122 KB
Volume: s2-19
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-19.1.13

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-disjoint Hamilton cycles in 4-regul

Edge-disjoint Hamilton cycles in 4-regular planar graphs

✍ J. A. Bondy; R. Häggkvist 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 179 KB

Edge disjoint Hamilton cycles in graphs

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

Edge-disjoint Hamilton cycles in graphs

✍ Demetres Christofides; Daniela Kühn; Deryk Osthus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Edge-Disjoint Hamilton Cycles in Graphs

✍ HAO LI; YONGJIN ZHU 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 492 KB

Edge-disjoint cycles in regular directed

Edge-disjoint cycles in regular directed graphs

✍ Alon, Noga; McDiarmid, Colin; Molloy, Michael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB 👁 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996

Edge disjoint Hamilton cycles in sparse

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk

✍ Bollob�s, B.; Cooper, C.; Fenner, T. I.; Frieze, A. M. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 3 views

Let G n,m,k denote the space of simple graphs with n vertices, m edges, and minimum degree at least k, each graph G being equiprobable. Let G have property A k , if G contains (k -1)/2 edge disjoint Hamilton cycles, and, if k is even, a further edge disjoint matching of size n/2 . We prove that, for