Barnette, D. (1991) The minimal projective plane polyhedral maps. In Applied Geometry and Discrete Mathematics, Vol. 4 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., AMS, pp. 63–70.
Bodlaender, H. L. and Thilikos, D. M. (1999) Graphs with branchwidth at most three. J. Algorithms 32 167–194.
Dharmatilake, J. (1994) Binary matroids with branch-width three. PhD thesis, Ohio State University.
Inkmann, T. (2008) Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem. PhD dissertation, Georgia Institute of Technology.
Johnson, E. and Robertson, N. Private communication.
Lins, S. (1981) A minimax theorem on circuits in projective graphs. J. Combin. Theory Ser. B 30 253–262.
Mohar, B. and Thomassen, C. (2001) Graphs on Surfaces, Johns Hopkins University Press.
Randby, S. P. (1997) Minimal embeddings in the projective plane. J. Graph Theory 25 153–164.
Robertson, N. and Seymour, P. D. (1990) Graph minors IV: Tree-width and well-quasi-ordering. J. Combin. Theory Ser. B 48 227–254.
Schrijver, A. (1991) Decomposition of graphs on surfaces and a homotopic circulation theorem. J. Combin. Theory Ser. B 51 161–210.
Schrijver, A. (1992) On the uniqueness of kernels. J. Combin. Theory Ser. B 55 146–160.
Schrijver, A. (1994) Classification of minimal graphs of given representativity on the torus. J. Combin. Theory Ser. B 61 217–236.
Seymour, P. D. and Thomas, R. (1994) Call routing and the ratcatcher. Combinatorica 14 217–241.
Vitray, R. P. (1993) Representativity and flexibility on the projective plane. In Graph Structure Theory (Seattle, WA, 1991), Vol. 147 of Contemp. Math., AMS, pp. 341–347.