Kneser Graphs Are Hamiltonian For n≥3k

Journal of Combinatorial Theory. Series B

Volumn 80, Issue 1, 2000, Pages 69-79

  Chen, Ya Chen ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Hamiltonian cycles; uniform subset graphs; antipodal layers problem; Kneser graphs; Gray codes; Erdos revolving door problem

Indexed keywords

EID: 0011672295     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.1969     Document Type: Article

References (17)

1. Baranyai Zs. On the factorization of the complete uniform hypergraph. Colloq. Math. Soc. János Bolyai. 10:1975;91-108.
2. Chen B.-L., Lih K.-W. Hamiltonian uniform subset graphs. J. Combin. Theory Ser. B. 42:1987;257-263.
3. Chen Y. Extremal Problems in Graph Theory: Hamiltonicity, Minimum Vertex-Diameter-2-Critical Graphs and Decomposition. 2000;University of Illinois, Urbana.
4. Chvátal V., Erdos P. A note on Hamiltonian circuits. Discrete Math. 2:1972;111-113.
5. Clark W. E., Ismail M. E. H. Binomial and Q-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their q-analogues. J. Combin. Theory Ser. A. 76:1996;83-98.
6. Cordova J., Dejter I. J., Quintana J. Two Hamilton cycles in bipartite reflective Kneser graphs. Discrete Math. 72:1988;63-70.
7. Dejter I. J. Hamilton cycles and quotients of bipartite graphs. Graph Theory with Applications to Algorithms and Computer Science. 1985;. p. 189-199.
8. Hável I. Semipaths in directed cubes. Fiedler M. Graphs and Other Combinatorial topics. 1982;101-108 Teubner, Leipzig.
9. Heinrich K., Wallis W. D. Hamiltonian cycles in certain graphs. J. Austral. Math. Soc. Ser. A. 26:1978;89-98.
10. Hurlbert G. The antipodal layers problem. Discrete Math. 128:1994;237-245.
11. Kelly D. Problem 2.5. Rival I. Graphs and Order: The Role of Graphs in the Theory of Ordered Sets and Its Applications. 1985;Reidel, Dordrecht.
12. 7. Combinatorics. 1972;229-236.
13. Lovász L. Problem 11. Combinatorial Structures and Their Applications. 1970;Gordon and Breach, New York.
14. Mather M. The rugby footballers of croam. J. Combin. Theory Ser. B. 20:1976;62-63.
15. C. D. Savage, and, I. Shields, A new Hamiltonian path heuristic with applications to the middle two levels problem, submitted for publication.
16. Savage C. D., Winkler P. Monotone gray codes and the middle levels problem. J. Combin. Theory Ser. A. 70:1995;230-248.
17. Simpson J. E. On uniform subset graphs. Ars Combin. 37:1994;309-318.