𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Closed trail decompositions of complete equipartite graphs

✍ Scribed by Andrea Burgess; Mateja Šajna

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
314 KB
Volume
17
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The complete equipartite graph \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$K_m * {\overline{K_n}}$\end{document} has mn vertices partitioned into m parts of size n, with two vertices adjacent if and only if they are in different parts. In this paper, we determine necessary and sufficient conditions for the existence of a decomposition of \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$K_m * {\overline{K_n}}$\end{document} into closed trails of length k. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 374–403, 2009

📜 SIMILAR VOLUMES

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

Decomposing complete equipartite graphs
Decomposing complete equipartite graphs into cycles of length 2p
✍ Benjamin R. Smith 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

## Abstract It is an open problem to determine whether a complete equipartite graph $K\_m\*{\overline{K}}\_n$ (having __m__ parts of size __n__) admits a decomposition into cycles of arbitrary fixed length $k$ whenever __m__, __n__, and __k__ satisfy the obvious necessary conditions for the existen

On resolvable tree-decompositions of com
On resolvable tree-decompositions of complete graphs
✍ Zbigniew Lonc 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB 👁 1 views

A partition of the edge set of a graph H into subsets inducing graphs H,, . . . , H, isomorphic to a graph G is said to be a G-decomposition of H. A G-decomposition of H is resolvable if the set {H,, . . . , H,} can be partitioned into subsets, called resolution classes, such that each vertex of H

Fair Hamilton Decompositions of Complete
Fair Hamilton Decompositions of Complete Multipartite Graphs
✍ C.D. Leach; C.A. Rodger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H 1 and H 2 , the difference in the number of edges in H 1 and H 2 joining vertices

r-Regular, r-connected decompositions of
r-Regular, r-connected decompositions of complete graphs
✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.