[2] M. Behzad G. Chartrand, L. Lesniak-Foster:
Graphs & Digraphs. Prindle, Weber & Schmidt, Boston 1979.
MR 0525578
[6] N. P. Homenko:
Method of $\fi$-transformations and some its applications. (in Ukrainian, English summary). $\fi$-peretvorennya grafiv (N. P. Homenko, ed.). IM AN URSR, Kiev 1973, pp. 35-96.
MR 0411995
[7] N. P. Homenko N. A. Ostroverkhy, V. A. Kusmenko: The maximum genus of a graph. (in Ukrainian, EngHsh summary). ($\fi$-peretvorennya grafiv (N. P. Homenko, ed.). IM AN URSR, Kiev 1973, pp. 180-210.
[8] M. Jungerman:
A characterization of upper embeddable graphs. Trans. Amer. Math. Soc. 241 (1978), 401-406.
MR 0492309 |
Zbl 0379.05025
[9] E. A. Nordhaus R. D. Ringeisen В. M. Stewart, and A. T. White:
A Kuratowski-type theorem for the maximum genus of a graph. J. Combinatorial Theory 12 В (1972), 260-267.
DOI 10.1016/0095-8956(72)90040-8 |
MR 0299523
[13] W. T. Tutte:
On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36 (1961), 221-230.
MR 0140438 |
Zbl 0096.38001
[14] A. T. White:
Graphs of groups on surfaces. In: Combinatorial Surveys: Proceedings of the Sixth British Combinatorial Conference (P. J. Cameron, ed.). Academic Press, London 1977, pp. 165-197.
MR 0491290 |
Zbl 0378.05028
[17] J. W. T. Youngs:
Minimal embeddings and the genus of a graph. J. Math. Mech. 12 (1963), 303-315.
MR 0145512