[1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston 1979. MR 0525578

[2] N. P. Homenko N. A. Ostroverkhy, V. A. Kusmenko: The maximum genus of a graph. (in Ukrainian, English summary). φ-peretvorennya grafiv (N. P. Homenko, ed.). IМ АN URSR, Kiev 1973, pp. 180-210. MR 0351870

[3] M. Jungerman: А characterization of upper embeddable graphs. Trans. Аmer. Math. Soc. 241 (1978), 401-406. MR 0492309 | Zbl 0379.05025

[4] L. Nebeský: А new characterization of the maximum genus of a graph. Czech. Math. J. 31 (106) (1981), 604-613. MR 0631605

[5] C. Payan, N. H. Xuong: Upper embeddability and connectivity of graphs. Discrete Math. 27 (1979), 71-80. MR 0534954 | Zbl 0407.05028

[6] R. D. Ringeisen: Survey of results on the maximum genus of a graph. J. Graph Theory 3 (1979), 1-13. MR 0519169 | Zbl 0398.05029

[7] G. Ringel: Map Сolor Theorem. Springer-Verlag, Berlin 1974. MR 0349461

[8] G. Ringel: The combinatorial map color theorem. J. Graph Theory 1 (1977), 141 - 155. MR 0444509 | Zbl 0386.05030

[9] S. Stahl: The embeddings of a graph - a survey. J. Graph Theory 2 (1978), 275-298. MR 0512799 | Zbl 0406.05027

[10] A. T. White: Graphs, Groups, and Ѕurfaces. North Holland, Аmsterdam 1973.

[11] N. H. Xuong: How to determine the maximum genus of a graph. J. Сombinatorial Тheory 26, Ѕer. B (1979), 217-225. MR 0532589 | Zbl 0403.05035