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

[2] N. P. Homenko N. A. Ostroverkhy, and V. A. Kiismenko: The maximum genus of a graph. (in Ukrainian, English summary). $\fi$-peretvorennya grafiv (N. P. Homenko, ed.) IM AN URSR, Kiev 1973, pp. 180-210. MR 0351870

[3] M. Jungerman: A characterization of upper embeddabie graphs. Trans. Amer. Math. Soc. 241 (1978), 401-406. MR 0492309

[4] С. St. J. A. Nash-Williams: Edge-disjoint spanning trees of finite graphs. J. London Math, Soc. 36 (1961), 445-450. MR 0133253 | Zbl 0102.38805

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

[6] W. T. Tutte: On the problem of decomposing a graph into n connected factors. J. London Maih. Soc. 36 (1961), 221-230. MR 0140438 | Zbl 0096.38001

[7] A. T. White: Graphs, Groups, and Surfaces. North-Holland, Amsterdam 1973. Zbl 0268.05102

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