Characterization of the maximum genus of a signed graph

Archdeacon, 1986, The non-orientable genus is additive, J. Graph Theory, 10, 363, 10.1002/jgt.3190100313 Edmonds, 1965, On the surface duality of linear graphs, J. Res. Nat. Bur. Standards Sect. B, 69, 121, 10.6028/jres.069B.012 Glukhov, 1980, On chord-critical graphs, 24 Goldstein, 1979, Applications of topological graph theory to group theory, Math. Z., 165, 1, 10.1007/BF01175125 Gross, 1987 Jungermann, 1978, A characterization of upper-embeddable graphs, Trans. Amer. Math. Soc., 241, 401 Khomenko, 1973, The method of ϕ-transformations and some of its applications, 35 Khomenko, 1980, Single-component 2-cell embeddings and the maximum genus of a graph, 5 Khomenko, 1973, The maximum genus of a graph, 180 Nebeský, 1981, A new characterization of the maximum genus of a graph, Czechoslovak Math. J., 31, 604, 10.21136/CMJ.1981.101776 Ringeisen, 1972, Determining all compact orientable 2-manifolds upon which Km,n has 2-cell embeddings, J. Combin. Theory Ser. B, 12, 101, 10.1016/0095-8956(72)90014-7 Ringel, 1977, The combinatorial Map Color Theorem, J. Graph Theory, 1, 141, 10.1002/jgt.3190010210 Širáň, 1968, Relative embeddings of graphs on closed surfaces, Math. Nachr., 136, 275, 10.1002/mana.19881360120 Škoviera, 1987, Oriented relative embeddings of graphs, Zastos. Mat., XIX, 589 Stahl, 1978, Generalized embedding schemes, J. Graph Theory, 2, 41, 10.1002/jgt.3190020106 Xuong, 1979, How to determine the maximum genus of a graph, J. Combin. Theory Ser. B, 26, 217, 10.1016/0095-8956(79)90058-3 Zaslavsky, 1982, Signed graphs, Discrete Appl. Math., 4, 47, 10.1016/0166-218X(82)90033-6 T. Zaslavsky, Orientation embedding of signed graphs, submitted. T. Zaslavsky, Is there a matroid theory of signed graph embedding?, submitted.