1. H.R. Brahana, Systems of circuits of two-dimensional manifolds, Ann. of Math. 30 (1923), 234–243.
2. D.J. Brown, M.R. Fellows and M.A. Langston, Polynomial-time self-reducibility: theoretical motivations and practical results,Int. J. Computer Mathematics (to appear).
3. J. Battle, F. Harary, Y. Kodama and J.W.T. Youngs, Additivity of the genus of a graph, Bull. Amer. Math. Soc. 68, 565–571.
4. R.A. Duke, The genus, regional number, and Betti number of a graph, Canad. J. Math. 18 (1966), 817–822.
5. M.L. Furst, L.L. Gross, and L.A. McGeoch, Finding a maximum-genus graph imbedding, preprint (1987).