✦ LIBER ✦

A Semiexact Degree Condition for Hamilton Cycles in Digraphs

✍ Scribed by Christofides, Demetres; Keevash, Peter; Kühn, Daniela; Osthus, Deryk

Book ID: 118197085
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 621 KB
Volume: 24
Category: Article
ISSN: 0895-4801
DOI: 10.1137/090761756

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Chvátal-Erdös condition for hamilton c

A Chvátal-Erdös condition for hamilton cycles in digraphs

✍ Bill Jackson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A degree condition for cycles of maximum

A degree condition for cycles of maximum length in bipartite digraphs

✍ Janusz Adamus; Lech Adamus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Hamilton cycles in digraphs of unitary m

Hamilton cycles in digraphs of unitary matrices

✍ G. Gutin; A. Rafiey; S. Severini; A. Yeo 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Minimum vertex degree conditions for loo

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

✍ Enno Buß; Hiệp Hàn; Mathias Schacht 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Hamilton Cycles in Random Graphs with a

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence

✍ Cooper, Colin; Frieze, Alan; Krivelevich, Michael 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 212 KB

A degree sum condition for longest cycle

A degree sum condition for longest cycles in 3-connected graphs

✍ Tomoki Yamashita 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB 👁 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and κ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__