Disjoint Hamiltonian cycles in recursive circulant graphs

DOI10.1016/S0020-0190(97)00020-3zbMath1336.05081MaRDI QIDQ287012

C. Micheneau

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Cayley graphcombinatorial problemscirculant graphHamiltonian decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (12)

Hamiltonian decomposition of generalized recursive circulant graphs ⋮ The super-connected property of recursive circulant graphs ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ Edge-disjoint Hamiltonian cycles of balanced hypercubes ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ Structural properties of subdivided-line graphs ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ Disjoint Hamilton cycles in the star graph ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ Maximum induced subgraph of a recursive circulant ⋮ Star graph automorphisms and disjoint Hamilton cycles ⋮ Pancyclicity of recursive circulant graphs

Cites Work

• Hamiltonian decomposition of Cayley graphs of degree 4
• Hamiltonian decompositions of Cayley graphs on Abelian groups
• Two edge-disjoint hamiltonian cycles in the butterfly graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjoint Hamiltonian cycles in recursive circulant graphs