✦ LIBER ✦

Equipartitions of graphs

✍ Scribed by David Eppstein; Joan Feigenbaum; Chung-Lun Li

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 578 KB
Volume: 91
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90233-8

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be an undirected graph on n nodes, and let k be an integer that divides n. A k-equipartition n of G is a partition of V(G) into k equal-sized pieces V,,

📜 SIMILAR VOLUMES

Closed trail decompositions of complete

Closed trail decompositions of complete equipartite graphs

✍ Andrea Burgess; Mateja Šajna 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

## 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,

Decomposing complete equipartite graphs

Decomposing complete equipartite graphs into short even cycles

✍ Benjamin R. Smith; Nicholas J. Cavenagh 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.

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

A generalization of the Oberwolfach prob

A generalization of the Oberwolfach problem and Ct-factorizations of complete equipartite graphs

✍ Jiuqiang Liu 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 1 views

Decomposing complete equipartite graphs

Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd

✍ Benjamin R. Smith 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract In this article, we introduce a new technique for obtaining cycle decompositions of complete equipartite graphs from cycle decompositions of related multigraphs. We use this technique to prove that if __n__, __m__ and λ are positive integers with __n__ ≥ 3, λ≥ 3 and __n__ and λ both odd

Generalized equipartition law

✍ V. Berdichevsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 303 KB