𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle systems of the line graph of the complete graph

✍ Scribed by Cox, B.A.; Rodger, C.A.

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
562 KB
Volume
21
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Cyclic even cycle systems of the complet
Cyclic even cycle systems of the complete graph
✍ Shung-Liang Wu πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 164 KB πŸ‘ 1 views

## Abstract In this article, it is proved that for each even integer __m__β©Ύ4 and each admissible value __n__ with __n__>2__m__, there exists a cyclic __m__‐cycle system of __K__~__n__~, which almost resolves the existence problem for cyclic __m__‐cycle systems of __K__~__n__~ with __m__ even. Β© 201

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

## Abstract We construct a new symmetric Hamilton cycle decomposition of the complete graph __K~n~__ for odd __n__ > 7. Β© 2003 Wiley Periodicals, Inc.

A 1-factorization of the line graphs of
A 1-factorization of the line graphs of complete graphs
✍ Brian Alspach πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 254 KB πŸ‘ 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.

The cycle space of an embedded graph
The cycle space of an embedded graph
✍ B. Richter; H. Shank πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 258 KB πŸ‘ 1 views

## Abstract Let __G__ be a connected graph with edge set __E__ embedded in the surface βˆ‘. Let __G__Β° denote the geometric dual of __G__. For a subset __d__ of __E__, let Ο„__d__ denote the edges of __G__Β° that are dual to those edges of __G__ in __d__. We prove the following generalizations of well‐

Maximum packings of the complete graph w
Maximum packings of the complete graph with uniform length cycles
✍ Daniel Horsley πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 86 KB

In this paper we find the maximum number of pairwise edgedisjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≀ m ≀ n.