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

Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles

โœ Scribed by Elizabeth J. Billington; Italo J. Dejter; D. G. Hoffman; C. C. Lindner

Book ID
106047903
Publisher
Springer Japan
Year
2010
Tongue
English
Weight
335 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Packing complete multipartite graphs wit
Packing complete multipartite graphs with 4-cycles
โœ 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
Maximum packings of the complete graph with uniform length cycles
โœ 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.

The Doyen-Wilson theorem for maximum pac
The Doyen-Wilson theorem for maximum packings of Kn with 4-cycles
โœ H.-L. Fu; C.C. Lindner ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 704 KB

Necessary and sufficient conditions are given to embed a maximum packing of K,, with 4-cycles into a maximum packing of K, with 4-cycles, both when the leave of the given packing is preserved, and when the leave of the given packing is not necessarily preserved.