[1] BEHZAD M.-CHARTRAD G.-LESNIAK-FOSTER L.: Graphs and Digraphs. Prindle, Weber and Schmidt, Boston, 1979.

[2] FU H. L.-TSAI M. C.: The maximum genus of diameter three graphs. Prepгint. Zbl 0862.05027

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

[4] KUNDU S.: Bounds on the number of disjoint spanning trees. J. Combin. Theory Ser. B 17 (1974), 199-203. MR 0369117

[5] NEBESKÝ L.: A new characterization of the maximum genus of a graph. Czechoslovak Math. J. 31(106) (1981), 604-613. MR 0631605 | Zbl 0482.05034

[6] NEBESKÝ L.: A note on upper embeddable graphs. Czechoslovak Math. J. 33(108) (1983), 37-40. MR 0687415 | Zbl 0518.05029

[7] NEBESKÝ L.: On 2-cell embeddings of graphs with minimum numbers of regions. Czechoslovak Math. J. 35(110) (1985), 625-631. MR 0809045 | Zbl 0586.05015

[8] NEDELA R.-ŠKOVIERA M.: The maximum genus of a graph and doubly Eulerian trails. Boll Un. Mat. Ital. B (7) 4 (1990), 541-551. MR 1073633 | Zbl 0715.05018

[9] ŠKOVIERA.-M.: The maximum genus of graphs of diameter two. Discrete Math. 87 (1991), 175-180. MR 1091590 | Zbl 0724.05021

[10] XUONG N. H.: How to determine the maximum genus of a graph. J. Combin. Theory Ser. B 26 (1979), 217-225. MR 0532589 | Zbl 0403.05035