✦ LIBER ✦

A survey on Hamilton cycles in directed graphs

✍ Scribed by Daniela Kühn; Deryk Osthus

Book ID: 113582417
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 361 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.09.030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton cycles in random graphs and dir

Hamilton cycles in random graphs and directed graphs

✍ Colin Cooper; Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 3 views

Hamilton cycles in directed Euler tour g

Hamilton cycles in directed Euler tour graphs

✍ Fu-ji Zhang; Xiao-feng Guo 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 516 KB

Hamilton Cycles in a Class of Random Dir

Hamilton Cycles in a Class of Random Directed Graphs

✍ C. Cooper; A. Frieze 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 449 KB

Degree sequences forcing Hamilton cycles

Degree sequences forcing Hamilton cycles in directed graphs

✍ Daniela Kühn; Deryk Osthus; Andrew Treglown 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 183 KB

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 Hamilton cycles in certain planar gra

On Hamilton cycles in certain planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

Let G be a 2-connected plane graph with outer cycle XG such that for every minimal vertex cut S of G with IS1 5 3, every component of G \ S contains a vertex of XG. A sufficient condition for G to be Hamiltonian is presented. This theorem generalizes both Tutte's theorem that every 4-connected plan