𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Packing λ-Fold Complete Multipartite Graphs with 4-Cycles

✍ Scribed by Elizabeth J. Billington; Hung-Lin Fu; C. A. Rodger

Book ID
106047542
Publisher
Springer Japan
Year
2005
Tongue
English
Weight
371 KB
Volume
21
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The metamorphosis of λ-fold block design
The metamorphosis of λ-fold block designs with block size four into a maximum packing of λKn with 4-cycles
✍ Selda Küçükçifçi; C.C Lindner; A Rosa 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 281 KB

Let (X; B) be a -fold block design with block size four and deÿne sets B(C) and E(K4 \ C) as follows: for each block b ∈ B, partition b into a 4-cycle and a pair of disjoint edges and place the 4-cycle in B(C) and the 2 disjoint edges in E(K4 \ C). If we can reassemble the edges belonging to E(K4 \

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.