On the directed Oberwolfach Problem with equal cycle lengths

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We examine the necessary and sufficient conditions for a complete symmetric digraph K*n to admit a resolvable decomposition into directed cycles of length m. We give a complete solution for even m, and a partial solution for odd m.

References Powered by Scopus

The Oberwolfach problem and factors of uniform odd length cycles

126Citations
N/AReaders
Get full text

Hamiltonian decomposition of Cayley graphs of degree 4

118Citations
N/AReaders
Get full text

A Hamiltonian decomposition of K<inf>2m</inf><sup>∗</sup>, 2m ≥ 8

79Citations
N/AReaders
Get full text

Cited by Powered by Scopus

On decomposition of the Cartesian product of directed cycles into cycles of equal lengths

4Citations
N/AReaders
Get full text

A Survey on Constructive Methods for the Oberwolfach Problem and Its Variants

1Citations
N/AReaders
Get full text

Completing the solution of the directed Oberwolfach problem with cycles of equal length

0Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Burgess, A., & Šajna, M. (2014). On the directed Oberwolfach Problem with equal cycle lengths. Electronic Journal of Combinatorics, 21(1). https://doi.org/10.37236/2982

Readers' Seniority

Tooltip

Professor / Associate Prof. 3

75%

Lecturer / Post doc 1

25%

Readers' Discipline

Tooltip

Mathematics 3

75%

Agricultural and Biological Sciences 1

25%

Save time finding and organizing research with Mendeley

Sign up for free