✦ LIBER ✦

Hamiltonian cycles in particular k-partite graphs

✍ Scribed by Jacqueline Ayel

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 242 KB
Volume: 32
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90037-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A degree sum condition on hamiltonian cy

A degree sum condition on hamiltonian cycles in balanced 3-partite graphs

✍ Kuniharu Yokomura 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Disjoint Hamiltonian cycles in fan 2k-ty

Disjoint Hamiltonian cycles in fan 2k-type graphs

✍ Zhou Sanming 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

## Abstract It is conjectured that a 2(__k__ + 1)‐connected graph of order __p__ contains __k__ + 1 pairwise disjoint Hamiltonian cycles if no two of its vertices that have degree less than 1/2 + 2__k__ are distance two apart. This is proved in detail for __k__ = 1. Similar arguments establish the

Small cycles in Hamiltonian graphs

✍ Uwe Schelten; Ingo Schiermeyer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 733 KB

We prove that if a graph G on n > 32 vertices is hamiltonian and has two nonadjacent vertices u and u with d(u) + d(u) 3 n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 < m < 1/5(n + 13).

Hamiltonian cycles in bipartite graphs

✍ Xiaoyun Lu 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 389 KB

Hamiltonian cycles in Dirac graphs

✍ Bill Cuckler; Jeff Kahn 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 606 KB

Partition of a bipartite hamiltonian gra

Partition of a bipartite hamiltonian graph into two cycles

✍ Denise Amar 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 480 KB

We prove the following theorem. "I'neorem. If G is a balanced bipartite graph with bipartition (A, B), [A I = IBI = n, such that for any x ~ A, y ~ B, d(x) + d(y) >>-n + 2, then for any (nl, n2), ni >I 2, n -----n I + hE, G contains two independent cycles of lengths 2nl and 2n2.