1. E. Birmelé, J.A. Bondy and B. Reed, The tree-width of the (3 × 3)-grid, manuscript.
2. R. Diestel, Graph Theory, Second edition. Graduate Texts in Mathematics, 173. Springer-Verlag, New York, 2000.
3. R. Diestel, K.Yu. Gorbunov, T.R. Jensen and C. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser.B, 75 (1999), 61–73.
4. P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.
5. B.A. Reed, Tree width and tangles: a new connectivity measure and some applications, in Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, Cambridge, 1997, 87–162.