𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The λ-complete multigraphs

✍ Scribed by M. L. Gardner

Book ID
102341896
Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
328 KB
Volume
5
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the Oberwolfach problem for complete
On the Oberwolfach problem for complete multigraphs
✍ Pavol Gvozdjak 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 368 KB

In this paper we solve a uniform length cycle version of the Oberwolfach problem for multigraphs by giving necessary and sufficient conditions for the existence of a 2-factorization of • ~gdm or )~gdm --I into 2-factors consisting of m cycles only.

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