✦ LIBER ✦

Hamilton Cycles and Degree Sequences

✍ Scribed by Dávid Szeszlér

Book ID: 108498137
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 166 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80188-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Degree sums,k-factors and hamilton cycle

Degree sums,k-factors and hamilton cycles in graphs

✍ R. J. Faudree; J. van den Heuvel 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 431 KB

A Semiexact Degree Condition for Hamilto

A Semiexact Degree Condition for Hamilton Cycles in Digraphs

✍ Christofides, Demetres; Keevash, Peter; Kühn, Daniela; Osthus, Deryk 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 621 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

Independence trees and Hamilton cycles

✍ Broersma, Hajo; Tuinstra, Hilde 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

Let G be a connected graph on n vertices. A spanning tree T of G is called an independence tree, if the set of end vertices of T (vertices with degree one in T ) is an independent set in G. If G has an independence tree, then α t (G) denotes the maximum number of end vertices of an independence tree