✦ LIBER ✦

Cycle decompositions of the line graph of Kn

✍ Scribed by M Colby; C.A Rodger

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 128 KB
Volume: 62
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(93)90078-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle Decompositions of Kn and Kn−I

✍ Brian Alspach; Heather Gavlas 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 251 KB

We establish necessary and sufficient conditions for decomposing the complete graph of even order minus a 1-factor into even cycles and the complete graph of odd order into odd cycles.

Symmetric Hamilton cycle decompositions

Symmetric Hamilton cycle decompositions of the complete graph

✍ Jin Akiyama; Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views

Cycle systems of the line graph of the c

Cycle systems of the line graph of the complete graph

✍ Cox, B.A.; Rodger, C.A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

For all m = 0 (mod 41, for all n = 0 or 2 (mod m), and for all n = 1 (mod 2m) w e find an m-cycle decomposition of the line graph of the complete graph K,. In particular, this solves the existence problem when m is a power of two.

On the decomposition of kn into complete

On the decomposition of kn into complete bipartite graphs

✍ H. Tverberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 1 views

## Abstract A short proof is given of the impossibility of decomposing the complete graph on __n__ vertices into __n__‐2 or fewer complete bipartite graphs.

Hamilton Cycle Decomposition of Line Gra

Hamilton Cycle Decomposition of Line Graphs and a Conjecture of Bermond

✍ A. Muthusamy; P. Paulraja 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 614 KB

In this paper it is proved that if a graph \(G\) has a decomposition into an even (resp., odd) number of Hamilton cycles, then \(L(G)\), the line graph of \(G\), has a decomposition into Hamilton cycles (resp., Hamilton cycles and a 2-factor). Further, we show that if \(G\) is a \(2 k\)-regular grap

On the decomposition of Kn into complete

On the decomposition of Kn into complete m-partite graphs

✍ Qingxue Huang 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

## Abstract Graham and Pollak [3] proved that __n__ −1 is the minimum number of edge‐disjoint complete bipartite subgraphs into which the edges of __K__~__n__~ can be decomposed. Using a linear algebraic technique, Tverberg [2] gives a different proof of that result. We apply his technique to show