✦ LIBER ✦

Cyclic even cycle systems of the complete graph

✍ Scribed by Shung-Liang Wu

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 164 KB
Volume: 20
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20310

No coin nor oath required. For personal study only.

✦ Synopsis

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. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:23–39, 2012

📜 SIMILAR VOLUMES

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.

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.

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

Bipartite graphs with cycles of all even

Bipartite graphs with cycles of all even lengths

✍ Edward Schmeichel; John Mitchem 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB 👁 1 views

## Abstract Let __G__ = (__X, Y, E__) be a bipartite graph with __X__ = __Y__ = __n__. Chvátal gave a condition on the vertex degrees of __X__ and __Y__ which implies that __G__ contains a Hamiltonian cycle. It is proved here that this condition also implies that __G__ contains cycles of every even

Hamilton cycle rich two-factorizations o

Hamilton cycle rich two-factorizations of complete graphs

✍ Darryn Bryant 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract For all integers __n__ ≥ 5, it is shown that the graph obtained from the __n__‐cycle by joining vertices at distance 2 has a 2‐factorization is which one 2‐factor is a Hamilton cycle, and the other is isomorphic to any given 2‐regular graph of order __n__. This result is used to prove s

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.