Disjoint Hamiltonian cycles in recursive circulant graphs
From MaRDI portal
Publication:287012
DOI10.1016/S0020-0190(97)00020-3zbMATH Open1336.05081MaRDI QIDQ287012FDOQ287012
Authors: C. Micheneau
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
- Hamiltonian decomposition of recursive circulant graphs
- On Hamilton decompositions of infinite circulant graphs
- Hamiltonian decomposition of generalized recursive circulant graphs
- scientific article; zbMATH DE number 1262801
- Arc-disjoint and edge-disjoint Hamilton cycles in circulants with two jumps
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (13)
- Edge-disjoint Hamiltonian cycles of balanced hypercubes
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
- Hamiltonian decomposition of generalized recursive circulant graphs
- Pancyclicity of recursive circulant graphs
- Disjoint Hamilton cycles in the star graph
- The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
- Hamiltonian decomposition of recursive circulant graphs
- The super-connected property of recursive circulant graphs
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)
- Maximum induced subgraph of a recursive circulant
- Star graph automorphisms and disjoint Hamilton cycles
- Structural properties of subdivided-line graphs
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
This page was built for publication: Disjoint Hamiltonian cycles in recursive circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287012)