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

Number of recurring cycles

โœ Scribed by S. Parameswaran

Publisher
Springer Vienna
Year
1956
Tongue
English
Weight
258 KB
Volume
60
Category
Article
ISSN
0026-9255

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The average number of cycles
The average number of cycles
โœ W. Plesken; D. Robertz ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer ๐ŸŒ English โš– 129 KB
Induced Cycles and Chromatic Number
Induced Cycles and Chromatic Number
โœ A.D. Scott ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 87 KB

We prove that, for any pair of integers k, l 1, there exists an integer N(k, l ) such that every graph with chromatic number at least N(k, l ) contains either K k or an induced odd cycle of length at least 5 or an induced cycle of length at least l.

On the number of Hamiltonian cycles in t
On the number of Hamiltonian cycles in triangulations
โœ Jan Kratochvil; Dainis Zeps ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 185 KB ๐Ÿ‘ 2 views

It is proved that if a planar triangulation different from K3 and K4 contains a Hamiltonian cycle, then it contains at least four of them. Together with the result of Hakimi, Schmeichel, and Thomassen [21, this yields that, for n 2 12, the minimum number of Hamiltonian cycles in a Hamiltonian planar