𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian decompositions of complete graphs

✍ Scribed by A.J.W Hilton

Book ID
107884194
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
545 KB
Volume
36
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonian decompositions of complete r
Hamiltonian decompositions of complete regular s-partite graphs
✍ A.J.W. Hilton; C.A. Rodger πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 962 KB

In this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph K~.....,~, where (s-1)n is even, can be constructed. For 2t<~s, l<~al<~...<~a~n, we find conditions which are necessary and sufficient for a decomposition of the edge-set of Kal.a2..... ~ into (s-1)n/2 class

Cycle decompositions of complete graphs
Cycle decompositions of complete graphs
✍ E.J. Farrell πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 447 KB

The circuit polynomial c%f the complete graph K, is used to deduce results about nodedisjoint -vcle decompositiorls of K,, satisfying variow restrictions.

Commuting decompositions of complete gra
Commuting decompositions of complete graphs
✍ Saieed Akbari; Allen Herman πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 129 KB

## Abstract We say that two graphs __G__ and __H__ with the same vertex set commute if their adjacency matrices commute. In this article, we show that for any natural number __r__, the complete multigraph __K__ is decomposable into commuting perfect matchings if and only if __n__ is a 2‐power. Also