Title of article
Kneser Graphs Are Hamiltonian For n⩾3k
Author/Authors
Chen، نويسنده , , Ya-Chen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
11
From page
69
To page
79
Abstract
The Kneser graph K(n, k) has as vertices the k-subsets of {1, 2, …, n}. Two vertices are adjacent if the k-subsets are disjoint. In this paper, we prove that K(n, k) is Hamiltonian for n⩾3k, and extend this to the bipartite Kneser graphs.
Keywords
Kneser graphs , Hamiltonian cycles , uniform subset graphs , antipodal layers problem , Erdo& , s revolving door problem , Gray codes , #x030B
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2000
Journal title
Journal of Combinatorial Theory Series B
Record number
1526692
Link To Document