{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:38:00Z","timestamp":1648795080175},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0012-365x(98)00037-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"139-149","source":"Crossref","is-referenced-by-count":5,"title":["The maximum genus of graphs with diameter three"],"prefix":"10.1016","volume":"194","author":[{"given":"Yuanqiu","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanpei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00037-5_BIB1","series-title":"Graph Theory Application","author":"Bondy","year":"1979"},{"key":"10.1016\/S0012-365X(98)00037-5_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(94)00336-H","article-title":"Maximum genus and connectivity","volume":"149","author":"Chen","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00037-5_BIB3","unstructured":"J. Chen, S.P. Kanchi, J.L. Gross, A tight low bound on the maximum genus of a simplicial graph, Discrete Math., to appear."},{"key":"10.1016\/S0012-365X(98)00037-5_BIB4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/44483.44485","article-title":"Find a maximum genus graph imbedding","volume":"35","author":"Furst","year":"1988","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/S0012-365X(98)00037-5_BIB5","series-title":"Embeddability in Graphs","author":"Liu","year":"1995"},{"issue":"106","key":"10.1016\/S0012-365X(98)00037-5_BIB6","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","article-title":"A new characterizations of the maximum genus of graphs","volume":"31","author":"Nebesky","year":"1981","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0012-365X(98)00037-5_BIB7","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"},{"key":"10.1016\/S0012-365X(98)00037-5_BIB8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(91)90046-5","article-title":"The maximum genus of diameter two","volume":"87","author":"\u0160koviera","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00037-5_BIB9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/jgt.3190020402","article-title":"The embeddings of graph \u2014 a survey","volume":"2","author":"Stahl","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00037-5_BIB10","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 graph","volume":"13","author":"Stahl","year":"1992","journal-title":"European J. Combin."},{"key":"10.1016\/S0012-365X(98)00037-5_BIB11","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"},{"issue":"5","key":"10.1016\/S0012-365X(98)00037-5_BIB12","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":"1979","journal-title":"Canad. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T06:40:32Z","timestamp":1620628832000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98000375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0012365X98000375"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00037-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}