A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs

Bonnington, 2000, Exponential families of non-isomorphic triangulations of complete graphs, J. Combin. Theory Ser. B, 78, 169, 10.1006/jctb.1999.1939 Brooks, 1941, On colouring the nodes of a network, Proc. Cambridge Philos. Soc., 37, 194, 10.1017/S030500410002168X Grannell, 2002, Recursive constructions for triangulations, J. Graph Theory, 39, 87, 10.1002/jgt.10014 Gross, 1987 Hall, 1967 Ireland, 1982 V. Korzhik, Exponentially many nonisomorphic orientable triangular embeddings of K12s and K12s+3, in preparation. Korzhik, 2001, On the number of nonisomorphic orientable regular embeddings of complete graphs, J. Combin. Theory Ser. B, 81, 58, 10.1006/jctb.2000.1993 Korzhik, 2002, Exponential families of nonisomorphic nontriangular orientable genus embeddings of complete graphs, J. Combin. Theory Ser. B, 86, 186, 10.1006/jctb.2002.2122 Korzhik, 2004, Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs, J. Combin. Theory Ser. B, 91, 253, 10.1016/j.jctb.2004.02.002 Ringel, 1974