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

DOI10.1016/J.DAM.2014.08.007zbMATH Open1303.05150OpenAlexW2084365053MaRDI QIDQ476301FDOQ476301

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

Recommendations

• Decomposition of circulants into antidirected Hamilton cycles
• Some results on decompositions of low degree circulant graphs
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Hamilton cycles in circulant digraphs with prescribed number of distinct jumps
• Hamiltonicity properties of circulant digraphs of semiprime or power of prime order

zbMATH Keywords

graph decomposition2-factorarc-disjoint cyclescirculant digraph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476301)