๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Hamiltonian Cycles in T-Graphs

โœ Scribed by Reay, J. R.; Zamfirescu, T.

Book ID
118786320
Publisher
Springer
Year
2000
Tongue
English
Weight
66 KB
Volume
24
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hamiltonian cycles in Dirac graphs
Hamiltonian cycles in Dirac graphs
โœ Bill Cuckler; Jeff Kahn ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 606 KB
Small cycles in Hamiltonian graphs
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).