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

DOI10.1016/j.dam.2017.05.017zbMath1367.05174OpenAlexW2730131490MaRDI QIDQ2012066

Zbigniew R. Bogdanowicz

Publication date: 27 July 2017

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

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

zbMATH Keywords

graph decompositionOberwolfach problemCartesian product of cyclesdirected cycle decomposition

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) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Unnamed Item ⋮ Identifying Hamilton cycles in the Cartesian product of directed cycles ⋮ Anti-Eulerian digraphs ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles

Cites Work

• Unnamed Item
• On the directed Oberwolfach problem with equal cycle lengths
• Decomposition of circulant digraphs with two jumps into cycles of equal lengths
• The Oberwolfach problem and factors of uniform odd length cycles
• Some observations on the oberwolfach problem
• Decomposing Complete Graphs Into Cycles of Length 2P
• When the cartesian product of directed cycles is Hamiltonian

This page was built for publication: On decomposition of the Cartesian product of directed cycles into cycles of equal lengths