×

zbMATH — the first resource for mathematics

The embeddings of a graph - a survey. (English) Zbl 0406.05027

MSC:
05C10 Planar graphs; geometric and topological aspects of graph theory
05-02 Research exposition (monographs, survey articles) pertaining to combinatorics
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Alpert, Trans. Amer. Math. Soc. 78 pp 1– (1973)
[2] (1978a). Combinatorial representations of polyhedral surfaces. Unpublished manuscript.
[3] (1978b). Current maps and nonorientable graph imbeddings. Unpublished manuscript.
[4] Alpert, Trans. Amer. Math. Soc. (1978c)
[5] Alpert, Bull. Amer. Math. Soc. 79 pp 942– (1973)
[6] Alpert, J. Combinatorial Theory Ser. B 20 pp 283– (1976)
[7] Auslander, J. Math. Mech. 12 pp 629– (1963)
[8] Battle, Bull. Amer. Math, Soc. 68 pp 565– (1962)
[9] see
[10] Beineke, Proc. Glasgow Math. Assoc. 7 pp 19– (1965a)
[11] Beineke, Canad. J. Math. 17 pp 494– (1965b) · Zbl 0127.13801 · doi:10.4153/CJM-1965-048-6
[12] Bénard, J. Combinatorial Theory Ser. B 24 pp 34– (1978)
[13] Bénard, J. Combinatorial Theory Ser. B 24 pp 257– (1976)
[14] Biggs, Rend. Mat. VI 4 pp 645– (1971)
[15] Bouchet, C. R. Acad. Sci. Paris Ser. A 280 pp 1669– (1975)
[16] (1976). Triangular imbeddings into surfaces of a join of equicardinal independent sets following an Eulerian graph. In Proceedings of the International Graph Theory Conference, edited by and Springer-Verlag, Berlin.
[17] Bouchet, C. R. Acad. Sci. Paris Sér. A-B 284 pp a527– (1977)
[18] Bouchet, J. Combinatorial Theory Ser. B 24 pp 24– (1978)
[19] see
[20] Brahana, Ann. of Math. 23 pp 144– (1922)
[21] see
[22] Decker, Notices Amer. Math. Soc. 25 pp a39– (1978)
[23] and (1898). Analysis situs. In Encyklopadie der Mathematischen Wissenschaften, edited by W. Fr. Meyer and H. Mohrmann. B. G. Teubner, Leipzig, Vol. III1.1.
[24] Dirac, Canad. J. Math. 4 pp 480– (1952) · Zbl 0047.42203 · doi:10.4153/CJM-1952-043-9
[25] Duke, Canad. J. Math. 18 pp 817– (1966) · Zbl 0141.21302 · doi:10.4153/CJM-1966-081-6
[26] Duke, Israel J. Math. 11 pp 452– (1972)
[27] Dyck, Math. Ann. 32 pp 457– (1888)
[28] Edmonds, Notices Amer. Math. Soc. 7 pp 646– (1960)
[29] Edmonds, J. Res. Nat. Bur. Standards Sect. B 69 pp 121– (1965) · Zbl 0132.20604 · doi:10.6028/jres.069B.012
[30] (1976). Cayley graph imbeddings and the associated block designs. Doctoral dissertation, Western Michigan University
[31] Garman, Canad. J. Math. 28 pp 523– (1976) · Zbl 0336.05103 · doi:10.4153/CJM-1976-052-9
[32] see
[33] (1973). The genus of nearly complete graphs–case 6. IBM Research Report No. RC 4302.
[34] (1974a). Rieman surfaces and the general utilities problem. In Basic Questions of Design Theory. New York, pp. 383–394.
[35] Gross, Discrete Math. 9 pp 239– (1974b)
[36] (1978). A short proof of Ringel’s complete bigraph theorem. Unpublished manuscript.
[37] see
[38] Gross, Pacific J. Math. 55 pp 391– (1974) · Zbl 0306.55001 · doi:10.2140/pjm.1974.55.391
[39] Gustin, Bull. Amer. Math. Soc. 69 pp 272– (1963)
[40] Guy, J. Combinatorial Theory Ser. B 21 pp 140– (1976)
[41] Guy, J. Combinatorial Theory Ser B 15 pp 1– (1973)
[42] see .
[43] (1971). Graph Theory. Addison-Wesley, Reading, Mass.
[44] see J. Battle.
[45] see .
[46] Harary, Fund. Math. 54 pp 7– (1964)
[47] see
[48] Heffter, Math. Ann. 50 pp 261– (1898)
[49] Heffter, Math. Ann. 38 pp 477– (1901)
[50] see .
[51] Jordan, J. Math. (2) 11 pp 105– (1866)
[52] Jungerman, J. Combinatorial Theory Ser. B 19 pp 69– (1975a)
[53] Jungerman, J. Combinatorial Theory Ser. B 19 pp 181– (1975b)
[54] Jungerman, Notices Amer. Math. Soc. 23 pp a35– (1976)
[55] Jungerman, Trans. Amer. Math. Soc. 241 pp 401– (1978a)
[56] (1978b). The nonorientable genus of K4(n). To appear.
[57] (1978c). The nonorientable genus of On. To appear.
[58] see
[59] see
[60] see
[61] Kuratowski, Fund. Math. 16 pp 271– (1930)
[62] Ladegaillerie, C. R. Acad. Sci. Paris 278 pp 1401– (1974a)
[63] Ladegaillerie, C. R. Acad. Sci. Paris 279 pp 129– (1974b)
[64] Landesman, J. Combinatorial Theory 13 pp 26– (1972)
[65] Mayer, J. Combinatorial Theory 6 pp 177– (1969)
[66] Milgram, J. Combinatorial Theory Ser. B 23 pp 227– (1977)
[67] Nordhaus, J. Combinatorial Theory 12 pp 260– (1972) · Zbl 0217.02301 · doi:10.1016/0095-8956(72)90040-8
[68] Pengelley, J. Combinatorial Theory Ser. B 18 pp 46– (1975)
[69] (1977). Revětements et plongements de graphes dans les surfaces. Doctoral dissertation, University of Poitiers.
[70] see .
[71] see .
[72] Ringel, J. Reine Angew. Math. 190 pp 129– (1952)
[73] Ringel, Math. Ann. 127 pp 181– (1954a)
[74] Ringel, J. Reine Angew. Math. 193 pp 11– (1954b)
[75] Ringel, Abh. Math. Sem. Univ. Hamburg 20 pp 10– (1955a)
[76] Ringel, Math. Ann. 130 pp 317– (1956b)
[77] (1959. Farbungsprobleme auf Flächen und Graphen. VEB Deutscher Verlag der Wissenschaften, Berlin.
[78] Ringel, Abh. Math. Sem. Univ. Hamburg 25 pp 105– (1961)
[79] Ringel, Abh. Math. Sem. Univ. Hamburg 28 pp 139– (1965a)
[80] Ringel, J. Reine Angew. Math. 220 pp 88– (1956b)
[81] (1974). Map Color Theorem. Springer-Verlag, Berlin. · Zbl 0287.05102 · doi:10.1007/978-3-642-65759-7
[82] Ringel, J. Graph Theory 1 pp 141– (1977)
[83] (1978a). The nonorientable genus of Kn X K2. To appear.
[84] (1978b). On the genus of Kn X K2. To appear.
[85] see .
[86] Ringel, J. Graph Theory. (1978)
[87] Ringel, Proc. Nat. Acad. Sci. U.S.A. 60 pp 438– (1968)
[88] Ringel, J. Combinatorial Theory 7 pp 71– (1969a)
[89] Ringel, J. Combinatorial Theory 7 pp 353– (1969a)
[90] Ringel, J. Combinatorial Theory 7 pp 342– (1969c)
[91] Ringel, Arch. Math. 20 pp 190– (1969d)
[92] Ringel, Comment. Math. Helv. 45 pp 152– (1970)
[93] (1976). A counting theorem for topological graph theory. Theory and Applications of Graphs (Proceedings of the Conference held at Western Michigan University, Kalamazoo, Mich., 1976), edited by and Lecture Notes in Mathematics. Springer-Verlag, New York, Vol. 642, pp. 534–544.
[94] Stahl, J. Graph Theory 2 pp 41– (1978a)
[95] Stahl, J. Combinatorial Theory. (1978b)
[96] Stahl, J. Graph Theory 1 pp 75– (1977)
[97] Stahl, Discrete Math. 14 pp 279– (1976)
[98] see .
[99] Terry, Bull. Amer. Math. Soc. 71 pp 653– (1965a)
[100] Terry, Bull. Amer. Math. Soc. 71 pp 657– (1965b)
[101] Terry, J. Combinatorial Theory 2 pp 43– (1967)
[102] Terry, J. Combinatorial Theory 8 pp 170– (1970)
[103] see .
[104] see
[105] see .
[106] White, J. Combinatorial Theory 7 pp 283– (1969a)
[107] (1969b). The genus of Cartesian products of graphs. Doctoral dissertation, Michigan State University.
[108] White, Trans. Amer. Math. Soc. 151 pp 393– (1970)
[109] White, J. Combinatorial Theory 11 pp 89– (1971a)
[110] (1971b). On the genus of products of graphs. In Recent Trends in Graph Theory, edited by , and Springer, Berlin, pp. 217–219.
[111] White, Pacific J. Math. 41 pp 275– (1972) · Zbl 0206.26101 · doi:10.2140/pjm.1972.41.275
[112] (1973). Graphs, Groups, and Surfaces. North Holland, Amsterdam.
[113] White, Duke Math. J. 41 pp 353– (1974)
[114] (1977). Graphs of groups on surfaces. In Combinatorial Surveys: Proceedings of the Sixth British Combinatorial Conference, edited by Academic, London, pp. 165–197.
[115] see .
[116] see .
[117] see
[118] Xuong, J. Combinatorial Theory Ser. B. (1978)
[119] Youngs, J. Math. Mech. 12 pp 303– (1963)
[120] (1967). The Heawood map-coloring conjecture. In Graph Theory and Theoretical Physics, edited by Academic, New York, pp. 313–354.
[121] Youngs, Bull. Amer. Math. Soc. 74 pp 347– (1968a)
[122] Youngs, Bull. Amer. Math. Soc. 74 pp 354– (1968b)
[123] Youngs, J. Combinatorial Theory 8 pp 175– (1970a)
[124] Youngs, J. Combinatorial Theory 8 pp 220– (1970b)
[125] see
[126] see
[127] see .
[128] see .
[129] see
[130] see .
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.