{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T01:40:09Z","timestamp":1685756409719},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T00:00:00Z","timestamp":1282953600000},"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":[[2011,3]]},"DOI":"10.1007\/s00373-010-0969-y","type":"journal-article","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T03:25:52Z","timestamp":1282879552000},"page":"187-197","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings of K 12s+7"],"prefix":"10.1007","volume":"27","author":[{"given":"Ren","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gao","family":"Yanbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,28]]},"reference":[{"key":"969_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0012-365X(02)00458-2","volume":"261","author":"R.L.E. Aldred","year":"2003","unstructured":"Aldred R.L.E., S\u0306ir\u00e1n\u0306 J., S\u0306ir\u00e1\u0148 M.: A note on the number of graceful labelings of paths. Discrete Math. 261, 27\u201330 (2003)","journal-title":"Discrete Math."},{"key":"969_CR2","first-page":"646","volume":"7","author":"J.R. Edmonds","year":"1960","unstructured":"Edmonds J.R.: A combinatorial representation for polyhedral surfaces. Notices Am. Math. Soc. 7, 646 (1960)","journal-title":"Notices Am. Math. Soc."},{"key":"969_CR3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/44483.44485","volume":"35","author":"M.L. Furst","year":"1988","unstructured":"Furst M.L., Gross J.L., McGeoch L.A.: Finding a maximum-genus graph imbedding. J. Assoc. Comput. Mach. 35, 523\u2013534 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"969_CR4","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1016\/j.jctb.2007.02.009","volume":"97","author":"L. Goddyn","year":"2007","unstructured":"Goddyn L., Bruce Richter R., S\u0306ir\u00e1n\u0306 J.: Triangular embeddings of complete graphs from graceful labelings of paths. J. Combin. Theory Ser. B 97, 964\u2013970 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"969_CR5","doi-asserted-by":"crossref","unstructured":"Grannell, M.J., Griggs, T.S.: Designs and Topology, Surveys in Combinatorics 2007. London Mathematical Society Lecture Notes Series, vol. 346, pp. 121\u2013174. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511666209.006"},{"key":"969_CR6","volume-title":"Topological Graph Theory","author":"J.L. Gross","year":"1987","unstructured":"Gross J.L., Tucker T.W.: Topological Graph Theory. Wiley, New York (1987)"},{"key":"969_CR7","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF01203357","volume":"38","author":"L. Heffter","year":"1891","unstructured":"Heffter L.: \u00dcber das Problem der Nachbargebiete. Math. Ann. 38, 477\u2013508 (1891)","journal-title":"Math. Ann."},{"key":"969_CR8","unstructured":"Liu, Y.P.: The maximum orientable genus of a graph (Chinese with English abstract). In: Scientia Sinica, Special Issue on Math. II, pp. 41\u201355 (1979)"},{"key":"969_CR9","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar B., Thomassen C.: Graphs on Surfaces. The Johns Hopkins University, Baltimore (2001)"},{"issue":"106","key":"969_CR10","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","volume":"31","author":"L. Nebesk\u00fd","year":"1981","unstructured":"Nebesk\u00fd L.: A new characterization of the maximum genus of a graph. Czechoslovak Math. 31(106), 604\u2013613 (1981)","journal-title":"Czechoslovak Math."},{"key":"969_CR11","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, Berlin (1974)"},{"key":"969_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0195-6698(92)90043-Y","volume":"13","author":"S. Stahl","year":"1991","unstructured":"Stahl S.: On the number of maximu genus embeddings of almost all graphs. Eur. J. Combin. 13, 119\u2013126 (1991)","journal-title":"Eur. J. Combin."},{"key":"969_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(91)90121-H","volume":"89","author":"S. Stahl","year":"1991","unstructured":"Stahl S.: Region distribution of some small diameter graphs. Dis. Math. 89, 281\u2013299 (1991)","journal-title":"Dis. Math."},{"key":"969_CR14","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/0196-6774(89)90006-0","volume":"10","author":"C. Thomassen","year":"1989","unstructured":"Thomassen C.: The graph genus problem is NP-complete. J. Algorithm 10, 568\u2013576 (1989)","journal-title":"J. Algorithm"},{"key":"969_CR15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","volume":"23","author":"N.H. Xuong","year":"1979","unstructured":"Xuong N.H.: How to determine the maximum genus of a graph. J. Combin. Theory Ser. B 23, 217\u2013225 (1979)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0969-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0969-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0969-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T01:04:20Z","timestamp":1685754260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0969-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,28]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["969"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0969-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,28]]}}}