✦ LIBER ✦

Edge partitions of complete multipartite graphs into equal length circuits

✍ Scribed by E.J Cockayne; B.L Hartnell

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 468 KB
Volume: 23
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90029-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposing complete multipartite graphs

Decomposing complete multipartite graphs into closed trails of arbitrary even lengths

✍ Benjamin R. Smith; Selda Küçükçifçi; Emineşule Yazıcı 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths.

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

Decomposition of the complete graph plus

Decomposition of the complete graph plus a 1-factor into cycles of equal length

✍ Mateja Šajna 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB 👁 1 views

## Abstract We determine the necessary and sufficient conditions for the existence of a decomposition of the complete graph of even order with a 1‐factor added into cycles of equal length. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 170–207, 2003; Published online in Wiley InterScience (www