An inductive construction for Hamilton cycles in Kneser graphs

zbMath1230.05181MaRDI QIDQ640449

J. Robert Johnson

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p189.html

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

A note on the middle levels problem ⋮ Unnamed Item ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Proof of the middle levels conjecture ⋮ Gray codes and symmetric chains ⋮ Sparse Kneser graphs are Hamiltonian

This page was built for publication: An inductive construction for Hamilton cycles in Kneser graphs