Explicit 2-factorizations of the odd graph

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

zbMATH Keywords

2-factorKneser graph2-factorisationOdd graph

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Explicit matchings in the middle levels of the Boolean lattice
• More odd graph theory
• An explicit 1-factorization in the middle of the Boolean lattice

This page was built for publication: Explicit 2-factorizations of the odd graph