Bipartite Kneser graphs are Hamiltonian
From MaRDI portal
Publication:5890906
DOI10.1016/j.endm.2015.06.036zbMath1346.05154OpenAlexW2595328939MaRDI QIDQ5890906
Publication date: 14 October 2016
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/118873/2/WRAP-bipartite-Kneser-graphs-Hamiltonian-Mutze-2016.pdf
Related Items
Trimming and gluing Gray codes, On the automorphism group of doubled Grassmann graphs, Unnamed Item, A minimum-change version of the Chung-Feller theorem for Dyck paths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long cycles in the middle two layers of the discrete cube
- An inductive construction for Hamilton cycles in Kneser graphs
- Kneser's conjecture, chromatic number, and homotopy
- On generalized middle-level problem
- An update on the middle levels problem
- Gray codes with restricted density
- Hamiltonian uniform subset graphs
- A survey of the theory of hypercube graphs
- Lexicographic matchings cannot form Hamiltonian cycles
- Explicit matchings in the middle levels of the Boolean lattice
- An explicit 1-factorization in the middle of the Boolean lattice
- The antipodal layers problem
- Triangle-free Hamiltonian Kneser graphs
- Hamiltonian Kneser graphs
- Monotone Gray codes and the middle levels problem
- The Rugby footballers of Croam
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
- The prism over the middle-levels graph is Hamiltonian
- Updating the hamiltonian problem—A survey
- A Survey of Combinatorial Gray Codes
- Reducibility among Combinatorial Problems
