1. Tough Ramsey graphs without short cycles;Alon;J. Algebraic Comb.,1995
2. A short proof of Kneser's conjecture;Bárány;J. Comb. Theory, Ser. A,1978
3. Toughness in graphs—a survey;Bauer;Graphs Comb.,2006
4. Not every 2-tough graph is Hamiltonian;Bauer,2000
5. Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability;Bollobás,1986