Abstract
In this paper we give new necessary and sufficient conditions for a directed circulant with vertices of outdegree two to have a pair of arc-disjoint Hamilton cycles. These conditions explicitly identify a pair of arc-disjoint Hamilton cycles if such cycles exist. In addition, we give necessary and sufficient conditions for an undirected circulant with vertices of degree four to have a specific pair of edge-disjoint Hamilton cycles.
Similar content being viewed by others
References
Alspach B., Locke S., Witte D.: The Hamilton spaces of Cayley graphs on Abelian groups. Discret. Math. 82, 113–126 (1990)
Bermond J.-C., Favaron O., Maheo M.: Hamiltonian decomposition of Cayley graphs of degree 4. J. Combin. Theory Ser. B. 46, 142–153 (1989)
Boesch F.T., Tindell R.: Circulants and their connectivities. J. Graph Theory 8, 129–138 (1984)
Bogdanowicz Z.R.: Hamilton cycles in circulant digraphs with prescribed number of distinct jumps. Discret. Math. 309, 2100–2107 (2009)
Bogdanowicz Z.R.: Pancyclicity of connected circulant graphs. J. Graph Theory. 22, 167–174 (1996)
Elspas B., Turner J.: Graphs with circulant adjacency matrices. J. Combin. Theory. 9, 297–307 (1970)
Keating K.: Multiple Hamiltonian graphs and digraphs. Ann. Discret. Math. 27, 81–88 (1985)
Lovász L.: Combinatorial Problems and Excersises. North-Holland, Amsterdam (1979)
Yang Q., Burkard R., Cela E., Woginger G.: Hamiltonian cycles in circulant digraphs with two stripes. Discret. Math. 176, 233–254 (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bogdanowicz, Z.R. Arc-Disjoint and Edge-Disjoint Hamilton Cycles in Circulants with Two Jumps. Graphs and Combinatorics 29, 165–171 (2013). https://doi.org/10.1007/s00373-011-1107-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1107-1