A Kuratowski-type theorem for the maximum genus of a graph

Journal of Combinatorial Theory, Series B - Tập 12 - Trang 260-267 - 1972
E.A Nordhaus1
1Michigan State University, East Lansing, Michigan 48823, USA

Tài liệu tham khảo

Battle, 1962, Additivity of the genus of a graph, Bull. Amer. Math. Soc., 68, 565, 10.1090/S0002-9904-1962-10847-7 Duke, 1966, The genus, regional number, and Betti number of a graph, Canad. J. Math., 18, 817, 10.4153/CJM-1966-081-6 Edmonds, 1960, A combinatorial representation for polyhedral surfaces, Notices, Amer. Math. Soc., 7, 646 Harary, 1969 Nordhaus, 1971, On the maximum genus of a graph, J. Combinatorial Theory B, 11, 258, 10.1016/0095-8956(71)90036-0 Ringeisen, 1970, The maximum genus of a graph Youngs, 1963, Minimal imbeddings and the genus of a graph, J. Math. Mech., 12, 303