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

A sufficient condition for Hamiltonian cycles in bipartite tournaments

โœ Scribed by Jing Tang; Jianzhong Wang; Wanpeng Lei

Publisher
Springer
Year
2007
Tongue
English
Weight
75 KB
Volume
23
Category
Article
ISSN
1573-8175

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A sufficient condition for all short cyc
A sufficient condition for all short cycles
โœ Stephan Brandt ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 279 KB

Generalizing a result of HSiggkvist et al. (1981), we prove that every non-bipartite graph of order n with more than (n -1)\*/4 + 1 edges contains cycles of every length between 3 and the length of a longest cycle.