𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposing toroidal graphs into circuits and edges

✍ Scribed by Baogang Xu; Lusheng Wang

Book ID
108112498
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
215 KB
Volume
148
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

On decomposition of r-partite graphs int
On decomposition of r-partite graphs into edge-disjoint hamilton circuits
✍ Renu Laskar; Bruce Auerbach πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 414 KB

Let It'Qn; r) denote the complete s-partite graph Kin, n, '.., n). it is shown hzre that for all even n(r -I) 2, Kfn; P) is the union of n(r -'I)/2 of its Hamilton circrlits which are mutually edge-disjoint, and for all odd nfr -1) 3 1, K(n; P) is the union of b(P -f) -r,,rs f l t ii o I s amilton c

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