✦ LIBER ✦

Mutually independent Hamiltonian cycles in alternating group graphs

✍ Scribed by Hsun Su, Shih-Yan Chen, Shin-Shin Kao

Book ID: 118810739
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 556 KB
Volume: 61
Category: Article
ISSN: 0920-8542
DOI: 10.1007/s11227-011-0614-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Mutually independent Hamiltonian cycles

Mutually independent Hamiltonian cycles in dual-cubes

✍ Yuan-Kang Shih; Hui-Chun Chuang; Shin-Shin Kao; Jimmy J. M. Tan 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 546 KB

Alternating hamiltonian cycles in two co

Alternating hamiltonian cycles in two colored complete bipartite graphs

✍ A. G. Chetwynd; A. J. W. Hilton 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 2 views

## Abstract We give necessary and sufficient conditions for the existence of an alternating Hamiltonian cycle in a complete bipartite graph whose edge set is colored with two colors.

Mutually Independent Hamiltonian Connect

Mutually Independent Hamiltonian Connectivity of (n,k)-Star Graphs

✍ Selina Yo-Ping Chang; Justie Su-Tzu Juan; Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-H 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 442 KB

Fault-free mutually independent Hamilton

Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges

✍ Sun-Yuan Hsieh; Pei-Yu Yu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 335 KB

Hamiltonian cycles in Dirac graphs

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

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).