Some gregarious cycle decompositions of complete equipartite graphs.
Smith, Benjamin R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order.”
Some gregarious cycle decompositions of complete equipartite graphs.
-cycle free one-factorizations of complete graphs.
Meszka, Mariusz (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graph products and new solutions to Oberwolfach problems.
Rinaldi, Gloria, Traetta, Tommaso (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Decomposing complete equipartite graphs into short odd cycles.
Smith, Benjamin R., Cavenagh, Nicholas J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alspach's problem: The case of Hamilton cycles and 5-cycles.
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on cycle double covers in Cayley graphs.
Hoffman, F., Locke, S.C., Meyerowitz, A.D. (1991)
Mathematica Pannonica
Similarity:
Alternating cycles and realizations of a degree sequence
Zofia Majcher (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Bent Hamilton cycles in -dimensional grid graphs.
Ruskey, F., Sawada, Joe (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
Frieze, Alan (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Longest induced cycles in circulant graphs.
Fuchs, Elena D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Symmetric Hamilton Cycle Decompositions of Complete Multigraphs
V. Chitra, A. Muthusamy (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m − F for all odd ⋋ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki and Brualdi and Schroeder) completely settle the existence of symmetric Hamilton cycle decomposition...