Decomposition of circulant digraphs with two jumps into cycles of equal lengths

DOI10.1016/J.DAM.2014.08.007zbMath1303.05150OpenAlexW2084365053MaRDI QIDQ476301

Zbigniew R. Bogdanowicz

Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.007

zbMATH Keywords

2-factorcirculant digraphgraph decompositionarc-disjoint cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Hamilton cycles in circulant digraphs with prescribed number of distinct jumps
• Hamiltonian decomposition of Cayley graphs of degree 4
• Hamiltonian decomposition of Cayley graphs of orders \(p^2\) and \(pq\)
• Arc-disjoint and edge-disjoint Hamilton cycles in circulants with two jumps
• Circulants and their connectivities
• Decomposing Complete Graphs Into Cycles of Length 2P

This page was built for publication: Decomposition of circulant digraphs with two jumps into cycles of equal lengths