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

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

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

[4] E. A. Nordhaus В. M. Stewart, A. T. White: On the maximum genus of a graph. J. Combinatorial Theory 11B (1971), 258-267. DOI 10.1016/0095-8956(71)90036-0 | MR 0286713

[5] С. Payan, N. H. Xuong: Upper embeddability and connectivity of graphs. Discrete Mathematics 27 (1979), 71 - 80. DOI 10.1016/0012-365X(79)90070-0 | 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. DOI 10.1002/jgt.3190030102 | MR 0519169 | Zbl 0398.05029

[7] G. Ringel: Map Color Theorem. Springer-Verlag, Berlin 1974. MR 0349461 | Zbl 0287.05102

[8] N. H. Xuong: How to determine the maximum genus of a graph. J. Combinatorial Theory 26B (1979), 217-225. DOI 10.1016/0095-8956(79)90058-3 | MR 0532589 | Zbl 0403.05035