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

Maximum cyclic 4-cycle packings of the complete multipartite graph

โœ Scribed by Shung-Liang Wu; Hung-Lin Fu


Book ID
106407108
Publisher
Springer US
Year
2007
Tongue
English
Weight
372 KB
Volume
14
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Packing complete multipartite graphs wit
โœ Elizabeth J. Billington; Hung-Lin Fu; C.A. Rodger ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 394 KB ๐Ÿ‘ 1 views
Maximum packings of the complete graph w
โœ Daniel Horsley ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 86 KB

In this paper we find the maximum number of pairwise edgedisjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3 โ‰ค m โ‰ค n.

Cyclic Hamiltonian cycle systems of the
โœ Marco Buratti; Alberto Del Fra ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if k is odd but k = 15 and p with p prime and ยฟ 1. As a consequence we have the existence of a cyclic k-cycle system of the complete graph on km vertices for any pair (k; m) of odd integers with k as abo