{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:26:38Z","timestamp":1757615198463,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,20]],"date-time":"1999-02-20T00:00:00Z","timestamp":919468800000},"content-version":"vor","delay-in-days":902,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0012-365x(95)00070-d","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"83-102","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["A tight lower bound on the maximum genus of a simplicial graph"],"prefix":"10.1016","volume":"156","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saroja P.","family":"Kanchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan L.","family":"Gross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00070-D_BIB1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-56402-0_40","article-title":"A linear time algorithm for isomorphism of graphs of bounded average genus","volume":"Vol. 657","author":"Chen","year":"1993","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0012-365X(95)00070-D_BIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0095-8956(92)90033-T","article-title":"Limit points for average genus I. 3-connected and 2-connected simplicial graphs","volume":"55","author":"Chen","year":"1992","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00070-D_BIB3","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0095-8956(92)90011-L","article-title":"Limit points for average genus II. 2-connected non-simplicial graphs","volume":"56","author":"Chen","year":"1992","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00070-D_BIB4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jctb.1993.1009","article-title":"Kuratowski-type theorems for average genus","volume":"57","author":"Chen","year":"1993","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00070-D_BIB5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/jgt.3190190302","article-title":"Lower bounds for the average genus","volume":"19","author":"Chen","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00070-D_BIB6","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-57155-8_251","article-title":"On the complexity of graph embeddings","volume":"Vol. 709","author":"Chen","year":"1993","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0012-365X(95)00070-D_BIB7","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/44483.44485","article-title":"Finding a maximum genus graph imbedding","volume":"35","author":"Furst","year":"1988","journal-title":"J. Asso. Comp. Mach."},{"key":"10.1016\/0012-365X(95)00070-D_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190110211","article-title":"Hierarchy of imbedding-distribution invariants of a graph","volume":"11","author":"Gross","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00070-D_BIB9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02988301","article-title":"On the average genus of graphs","volume":"9","author":"Gross","year":"1993","journal-title":"Graphs Combin."},{"year":"1987","series-title":"Topological Graph Theory","author":"Gross","key":"10.1016\/0012-365X(95)00070-D_BIB10"},{"key":"10.1016\/0012-365X(95)00070-D_BIB11","first-page":"337","article-title":"Genre maximal et connectivit\u00e9 d'un graphe","volume":"285","author":"Jaeger","year":"1977","journal-title":"C. R. Acad. Sc. Paris"},{"key":"10.1016\/0012-365X(95)00070-D_BIB12","first-page":"401","article-title":"A characterization of upper embeddable graphs","volume":"241","author":"Jungerman","year":"1978","journal-title":"Trans. Amer. Math. Soc."},{"year":"1992","series-title":"A tight lower bound on the maximum genus of a 2-connected simplicial graph, Manuscript","author":"Kanchi","key":"10.1016\/0012-365X(95)00070-D_BIB13"},{"key":"10.1016\/0012-365X(95)00070-D_BIB14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0095-8956(74)90087-2","article-title":"Bounds on number of disjoint spanning trees","volume":"17","author":"Kundu","year":"1974","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00070-D_BIB15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190050211","article-title":"Every connected, locally connected graph is upper imbeddable","volume":"5","author":"Nebesk\u00fd","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00070-D_BIB16","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0095-8956(72)90040-8","article-title":"A Kuratowski-type theorem for the maximum genus of a graph","volume":"12","author":"Nordhaus","year":"1972","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00070-D_BIB17","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0095-8956(71)90036-0","article-title":"On the maximum genus of a graph","volume":"11","author":"Nordhaus","year":"1971","journal-title":"J. Combin. Theory B"},{"issue":"No. 2, 3, 4","key":"10.1016\/0012-365X(95)00070-D_BIB18","first-page":"319","article-title":"Ensembles cycliquement stables et graphes cubiques","author":"Payan","year":"1975","journal-title":"Cahiers du Centre d'Etude de Recherche Op\u00e9rationnelle (Bruxelle)"},{"article-title":"The maximum genus of a graph","year":"1970","author":"Ringeisen","key":"10.1016\/0012-365X(95)00070-D_BIB19"},{"key":"10.1016\/0012-365X(95)00070-D_BIB20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0095-8956(72)90014-7","article-title":"Determining all compact orientable 2-manifolds upon which Km,n has 2-cell imbeddings","volume":"12","author":"Ringeisen","year":"1972","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00070-D_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190030102","article-title":"Survey of results on the maximum genus of a graph","volume":"3","author":"Ringeisen","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00070-D_BIB22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(91)90046-5","article-title":"The maximum genus of graphs of diameter two","volume":"87","author":"Skoviera","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00070-D_BIB23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0012-365X(90)90045-J","article-title":"Region distributions of graph embeddings and stirling numbers","volume":"82","author":"Stahl","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00070-D_BIB24","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(91)90121-H","article-title":"Region distributions of some small diameter graphs","volume":"89","author":"Stahl","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00070-D_BIB25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0195-6698(92)90043-Y","article-title":"On the number of maximum genus embeddings of almost all graphs","volume":"13","author":"Stahl","year":"1992","journal-title":"Euro. J. Combin."},{"year":"1984","series-title":"Graphs, Groups and Surfaces","author":"White","key":"10.1016\/0012-365X(95)00070-D_BIB26"},{"key":"10.1016\/0012-365X(95)00070-D_BIB27","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","article-title":"How to determine the maximum genus of a graph","volume":"26","author":"Xuong","year":"1979","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00070-D_BIB28","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0095-8956(79)90059-5","article-title":"Upper-embeddable graphs and related topics","volume":"26","author":"Xuong","year":"1979","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00070-D_BIB29","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.4153\/CJM-1974-096-2","article-title":"The maximum genus of cartesian products of graphs","volume":"26","author":"Zaks","year":"1974","journal-title":"Canad. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500070D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500070D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:34:34Z","timestamp":1757079274000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500070D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0012365X9500070D"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00070-d","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1996,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A tight lower bound on the maximum genus of a simplicial graph","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(95)00070-D","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}