Explicit 2-factorizations of the odd graph
From MaRDI portal
Publication:1765963
DOI10.1007/s11083-004-3344-xzbMath1056.05115OpenAlexW2092341368WikidataQ47647672 ScholiaQ47647672MaRDI QIDQ1765963
J. Robert Johnson, Henry A. Kierstead
Publication date: 25 February 2005
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-004-3344-x
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
A note on the middle levels problem ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ On the \(P_3\)-hull number of Kneser graphs ⋮ On hamiltonian cycles in the prism over the odd graphs ⋮ Sparse Kneser graphs are Hamiltonian
Cites Work
This page was built for publication: Explicit 2-factorizations of the odd graph