𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition of complete multigraphs into crown graphs

✍ Scribed by Zhihe Liang; Jinping Guo

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
369 KB
Volume
32
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decomposition of complete multigraphs in
Decomposition of complete multigraphs into stars
✍ Michael Tarsi πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 531 KB

A necessary and sufficient condition for the existence of a decomposition of A&, irto stars is given. A complete multigraph AK, is a complete graph & in which every edge is taken A times. A complete multigraph A&, is said to have a G-decomposition G[h, v] if it is a union of edge disjoint subgraphs

Cycle decompositions of complete multigr
Cycle decompositions of complete multigraphs
✍ Benjamin R. Smith πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 106 KB

## Abstract In this paper we establish necessary and sufficient conditions for decomposing the complete multigraph Ξ»__K__~__n__~ into cycles of length Ξ», and the λ‐fold complete symmetric digraph Ξ»__K__ into directed cycles of length Ξ». As a corollary to these results we obtain necessary and suffic

Cycle decompositions of complete multigr
Cycle decompositions of complete multigraphs
✍ Darryn Bryant; Daniel Horsley; Barbara Maenhaut; Benjamin R. Smith πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 265 KB

It is shown that the obvious necessary conditions for the existence of a decomposition of the complete multigraph with n vertices and with k edges joining each pair of distinct vertices into m-cycles, or into m-cycles and a perfect matching, are also sufficient. This result follows as an easy conseq

Decomposition of complete graphs into 5-
Decomposition of complete graphs into 5-cubes
✍ D. Bryant; S. I. El-Zanati; B. Maenhaut; C. Vanden Eynden πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

## Abstract Necessary conditions for the complete graph on __n__ vertices to have a decomposition into 5‐cubes are that 5 divides __n__β€‰βˆ’β€‰1 and 80 divides __n__(__n__β€‰βˆ’β€‰1)/2. These are known to be sufficient when __n__ is odd. We prove them also sufficient for __n__ even, thus completing the spectr