{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:10:24Z","timestamp":1758823824645},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,19]],"date-time":"2012-04-19T00:00:00Z","timestamp":1334793600000},"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":[[2013,7]]},"DOI":"10.1007\/s00373-012-1163-1","type":"journal-article","created":{"date-parts":[[2012,4,18]],"date-time":"2012-04-18T06:38:54Z","timestamp":1334731134000},"page":"921-932","source":"Crossref","is-referenced-by-count":4,"title":["Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"M. J.","family":"Grannell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Knor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,19]]},"reference":[{"key":"1163_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0097-3165(75)90070-9","volume":"18","author":"S.R. Alpert","year":"1975","unstructured":"Alpert S.R.: Twofold triple systems and graph imbeddings. J. Combin. Theory Ser. A 18, 101\u2013107 (1975)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1163_CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1006\/jctb.1999.1939","volume":"78","author":"C.P. Bonnington","year":"2000","unstructured":"Bonnington C.P., Grannell M.J., Griggs T.S., \u0160ir\u00e1\u0148 J.: Exponential families of nonisomorphic triangulations of complete graphs. J. Combin. Theory Ser. B 78, 169\u2013184 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1163_CR3","doi-asserted-by":"crossref","unstructured":"Colbourn C.J., Dinitz J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2006)","DOI":"10.1201\/9781420010541"},{"key":"1163_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198535768.001.0001","volume-title":"Triple Systems","author":"C.J. Colbourn","year":"1999","unstructured":"Colbourn C.J., Rosa A.: Triple Systems. Clarendon Press, New York (1999)"},{"key":"1163_CR5","volume-title":"Latin Squares and their Applications","author":"J. D\u00e9nes","year":"1974","unstructured":"D\u00e9nes J., Keedwell A.D.: Latin Squares and their Applications. Akad\u00e9miai Kiad\u00f3\/ English Universities Press\/Academic Press, Budapest\/London\/New York (1974)"},{"key":"1163_CR6","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.jctb.2007.10.002","volume":"98","author":"M.J. Grannell","year":"2008","unstructured":"Grannell M.J., Griggs T.S.: A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs. J. Combin. Theory Ser. B 98, 637\u2013650 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1163_CR7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1017\/S0017089504001922","volume":"46","author":"M.J. Grannell","year":"2004","unstructured":"Grannell M.J., Griggs T.S., Knor M.: Biembeddings of Latin squares and Hamiltonian decompositions. Glasgow Math. J. 46, 443\u2013457 (2004)","journal-title":"Glasgow Math. J."},{"key":"1163_CR8","doi-asserted-by":"crossref","unstructured":"Grannell M.J., Griggs T.S., Knor M.: On biembeddings of Latin squares, Electron. J. Combin. 16, R106, 12pp (2009)","DOI":"10.1002\/jcd.20235"},{"key":"1163_CR9","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.disc.2005.10.025","volume":"306","author":"M.J. Grannell","year":"2006","unstructured":"Grannell M.J., Griggs T.S., Knor M., \u0160ir\u00e1\u0148 J.: Triangulations of orientable surfaces by complete tripartite graphs. Discrete Math. 306, 600\u2013606 (2006)","journal-title":"Discrete Math."},{"key":"1163_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.10014","volume":"39","author":"M.J. Grannell","year":"2002","unstructured":"Grannell M.J., Griggs T.S., \u0160ir\u00e1\u0148 J.: Recursive constructions for triangulations. J. Graph Theory 39, 87\u2013107 (2002)","journal-title":"J. Graph Theory"},{"key":"1163_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jcd.20252","volume":"18","author":"M.J. Grannell","year":"2010","unstructured":"Grannell M.J., Knor M.: Biembeddings of Abelian groups. J. Combin. Designs 18, 71\u201383 (2010)","journal-title":"J. Combin. Designs"},{"key":"1163_CR12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.jctb.2009.08.001","volume":"100","author":"M.J. Grannell","year":"2010","unstructured":"Grannell M.J., Knor M.: A lower bound for the number of orientable triangular embeddings of some complete graphs. J. Combin. Theory Ser. B 100, 216\u2013225 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1163_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.disc.2004.01.013","volume":"285","author":"M.J. Grannell","year":"2004","unstructured":"Grannell M.J., Korzhik V.P.: Nonorientable biembeddings of Steiner triple systems. Discrete Math. 285, 121\u2013126 (2004)","journal-title":"Discrete Math."},{"key":"1163_CR14","volume-title":"Topological Graph Theory","author":"J.L. Gross","year":"1987","unstructured":"Gross J.L., Tucker T.W.: Topological Graph Theory. John Wiley, New York (1987)"},{"key":"1163_CR15","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1016\/j.disc.2007.03.056","volume":"308","author":"V.P. Korzhik","year":"2008","unstructured":"Korzhik V.P.: Exponentially many nonisomorphic orientable triangular embeddings of K 12s . Discrete Math. 308, 1046\u20131071 (2008)","journal-title":"Discrete Math."},{"key":"1163_CR16","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1016\/j.disc.2008.01.027","volume":"309","author":"V.P. Korzhik","year":"2009","unstructured":"Korzhik V.P.: Exponentially many nonisomorphic orientable triangular embeddings of K 12s+3. Discrete Math. 309, 852\u2013866 (2009)","journal-title":"Discrete Math."},{"key":"1163_CR17","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1006\/jctb.2000.1993","volume":"81","author":"V.P. Korzhik","year":"2001","unstructured":"Korzhik V.P., Voss H.-J.: On the number of nonisomorphic orientable regular embeddings of complete graphs. J. Combin. Theory Ser. B 81, 58\u201376 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1163_CR18","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1006\/jctb.2002.2122","volume":"86","author":"V.P. Korzhik","year":"2002","unstructured":"Korzhik V.P., Voss H.-J.: Exponential families of nonisomorphic non-triangular orientable genus embeddings of complete graphs. J. Combin. Theory Ser. B 86, 186\u2013211 (2002)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1163_CR19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.jctb.2004.02.002","volume":"91","author":"V.P. Korzhik","year":"2004","unstructured":"Korzhik V.P., Voss H.-J.: Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. J. Combin. Theory Ser. B 91, 253\u2013287 (2004)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1163_CR20","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0012-365X(94)00225-8","volume":"135","author":"S. Lawrencenko","year":"1994","unstructured":"Lawrencenko S., Negami S., White A.T.: Three nonisomorphic triangulations of an orientable surface with the same complete graph. Discrete Math. 135, 367\u2013369 (1994)","journal-title":"Discrete Math."},{"key":"1163_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-65759-7","volume-title":"Map Color Theorem","author":"G. Ringel","year":"1974","unstructured":"Ringel G.: Map Color Theorem. Springer, New York (1974)"},{"key":"1163_CR22","first-page":"17","volume-title":"The mystery of the Heawood conjecture in Graph Theory and its Applications","author":"J.W.T. Youngs","year":"1970","unstructured":"Youngs J.W.T.: The mystery of the Heawood conjecture in Graph Theory and its Applications, pp. 17\u201350. Academic Press, New York (1970)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1163-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1163-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1163-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T10:44:08Z","timestamp":1713869048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1163-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,19]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1163"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1163-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,19]]}}}