{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T06:46:50Z","timestamp":1747896410817},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T00:00:00Z","timestamp":1272326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s00373-010-0938-5","type":"journal-article","created":{"date-parts":[[2010,4,26]],"date-time":"2010-04-26T04:01:22Z","timestamp":1272254482000},"page":"537-548","source":"Crossref","is-referenced-by-count":4,"title":["Polyhedral Suspensions of Arbitrary Genus"],"prefix":"10.1007","volume":"26","author":[{"given":"Serge","family":"Lawrencenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,27]]},"reference":[{"key":"938_CR1","unstructured":"Bushmelev, A.V., Lawrencenko, S.: Polyhedral tori (in Russian). Kvant 2, 3\u20135 (1985). http:\/\/kvant.mirror1.mccme.ru\/1985\/02\/mnogogranniki\u2013tory.htm"},{"key":"938_CR2","volume-title":"Introduction to Geometry","author":"H.S.M. Coxeter","year":"1969","unstructured":"Coxeter H.S.M.: Introduction to Geometry, 2nd edn. Wiley, New York (1969)","edition":"2"},{"key":"938_CR3","unstructured":"Cs\u00e1sz\u00e1r, A.: A polyhedron without diagonals. Acta Sci. Math. (Szeged) 13, 140\u2013142 (1949\u20131950)"},{"key":"938_CR4","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry I.: On straight line representations of planar graphs. Acta Sci. Math. (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"938_CR5","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1145\/322154.322156","volume":"20","author":"J.L. Gross","year":"1979","unstructured":"Gross J.L., Rosen R.H.: A linear-time planarity algorithm for 2-complexes. J. Assoc. Comput. Mach. 20, 611\u2013617 (1979)","journal-title":"J. Assoc. Comput. Mach."},{"key":"938_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.4064\/cm-44-2-241-247","volume":"44","author":"J.L. Gross","year":"1981","unstructured":"Gross J.L., Rosen R.H.: A combinatorial characterization of planar 2-complexes. Colloq. Math. 44, 241\u2013247 (1981)","journal-title":"Colloq. Math."},{"key":"938_CR7","volume-title":"Topological Graph Theory","author":"J.L. Gross","year":"2001","unstructured":"Gross J.L., Tucker T.W.: Topological Graph Theory. Dover, New York (2001)"},{"key":"938_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(93)90295-5","volume":"122","author":"F. Harary","year":"1993","unstructured":"Harary F., Lawrencenko S., Korzhik V.: Realizing the chromatic numbers of triangulations of surfaces. Discrete Math. 122, 197\u2013204 (1993)","journal-title":"Discrete Math."},{"key":"938_CR9","doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u00fd, P., Salazar, G.: Approximating the crossing number of toroidal graphs. In: Tokuyama, T., et\u00a0al. (eds.) Algorithms and Computation. Proceedings of ISAAC 2007. Lecture Notes in Computer Science, vol. 4835, pp. 148\u2013159. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-77120-3_15"},{"key":"938_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"Kuratowski K.: Sur le probl\u00e8me des courbes gauches en topologie. Fund. Math. 15, 271\u2013283 (1930)","journal-title":"Fund. Math."},{"key":"938_CR11","unstructured":"Lawrencenko, S.: All the twenty-one irreducible triangulations of the torus are realizable as polyhedra in E 3 (in Russian)] (Second-place-winning Manuscript, Student Research Paper Contest, Faculty of Mech. & Math.). Moscow State University, Moscow (1983)"},{"key":"938_CR12","unstructured":"Lawrencenko, S.: All irreducible triangulations of the torus are realizable as polyhedra in E 3 (in Russian) (Master\u2019s Thesis). Moscow State University, Moscow (1984)"},{"key":"938_CR13","unstructured":"Lawrencenko, S.: Explicit enumeration of all automorphisms of the toroidal irreducible triangulations and all toroidal embeddings of the labeled graphs of those triangulations (in Russian) (No. 2779 Uk87. 1 Oct 1987). UkrNIINTI, Kharkov (1987)"},{"key":"938_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<281::AID-JGT10>3.0.CO;2-I","volume":"24","author":"B. Mohar","year":"1997","unstructured":"Mohar B.: On the minimal genus of 2-complexes. J. Graph Theory 24, 281\u2013290 (1997)","journal-title":"J. Graph Theory"},{"key":"938_CR15","unstructured":"Mohar, B.: Personal communication to S. Lawrencenko (31 Mar 2009)"},{"key":"938_CR16","unstructured":"Negami, S.: A verbal comment on a talk given by S. Lawrencenko at 20th (International) Workshop on Topological Graph Theory in Yokohama (27 Nov 2008)"},{"key":"938_CR17","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f3th, G.: Crossing number of toroidal graphs. In: Klazar, M., et\u00a0al. (eds.): Topics in Discrete Mathematics, Dedicated to Jarik Ne\u0161etoil on the occasion of his 60th birthday (Algorithms and Combinatorics, vol. 26, pp. 581\u2013590). Springer, Berlin (2006)","DOI":"10.1007\/3-540-33700-8_28"},{"key":"938_CR18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0012-365X(73)90047-2","volume":"6","author":"R.D. Ringeisen","year":"1973","unstructured":"Ringeisen R.D.: Graphs of given genus and arbitrarily large maximum genus. Discrete Math. 6, 169\u2013174 (1973)","journal-title":"Discrete Math."},{"key":"938_CR19","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1073\/pnas.60.2.438","volume":"60","author":"G. Ringel","year":"1968","unstructured":"Ringel G., Youngs J.W.T.: Solution of the Heawood map-coloring problem. Proc. Natl. Acad. Sci. USA 60, 438\u2013445 (1968)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"938_CR20","volume-title":"Vorlesungen \u00fcber die Theorie der Polyeder","author":"E. Steinitz","year":"1934","unstructured":"Steinitz E., Rademacher H.: Vorlesungen \u00fcber die Theorie der Polyeder. Springer, Berlin (1934)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0938-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0938-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0938-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T18:24:06Z","timestamp":1559067846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0938-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,27]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["938"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0938-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,27]]}}}