1. Trading crossings for handles and crosscaps;Archdeacon;J. Graph Theory,2001
2. Drawing disconnected graphs on the Klein bottle;Beaudou;Graphs Combin.,2010
3. Decomposition of graphs on surfaces;de Graaf;J. Combin. Theory Ser. B,1997
4. Unexpected behaviour of crossing sequences;DeVos;J. Combin. Theory Ser. B,2011
5. A. Schrijver, Combinatorial optimization. Polyhedra and efficiency. Vol. C, Algorithms and Combinatorics, vol. 24, Springer-Verlag, Berlin, 2003, Disjoint paths, hypergraphs, Chapters 70–83.