Triangle-free Hamiltonian Kneser graphs
Author:
- Ya-Chen ChenYCYa-Chen Chen
- 1 September 2003
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 89 (1) , 1-16
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Kneser Graphs Are Hamiltonian For n⩾3kJournal of Combinatorial Theory, Series B, 2000
- Binomial andQ-Binomial Coefficient Inequalities Related to the Hamiltonicity of the Kneser Graphs and TheirQ-AnaloguesJournal of Combinatorial Theory, Series A, 1996
- Monotone Gray codes and the middle levels problemJournal of Combinatorial Theory, Series A, 1995
- The antipodal layers problemDiscrete Mathematics, 1994
- Hamiltonian uniform subset graphsJournal of Combinatorial Theory, Series B, 1987
- Hamiltonian cycles in certain graphsJournal of the Australian Mathematical Society, 1978
- The rugby footballers of croamJournal of Combinatorial Theory, Series B, 1976
- The footballers of CroamJournal of Combinatorial Theory, Series B, 1973
- Coefficients of chromatic polynomialsJournal of Combinatorial Theory, Series B, 1972
- 12. The Number of Simplices in a Complex1963