Hamiltonian decomposition of recursive circulant graphs

DOI10.1016/S0012-365X(99)00199-5zbMath0944.05064OpenAlexW2056896777MaRDI QIDQ1972132

Daniel K. Biss

Publication date: 15 September 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00199-5

zbMATH Keywords

circulant graphhamiltonian decomposable graphs

Mathematics Subject Classification ID

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

Related Items (11)

Hamiltonian decomposition of generalized recursive circulant graphs ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ On Hamiltonian paths in distance graphs ⋮ Long cycles and paths in distance graphs ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ Maximum induced subgraph of a recursive circulant ⋮ Pancyclicity of recursive circulant graphs

This page was built for publication: Hamiltonian decomposition of recursive circulant graphs