{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:38:07Z","timestamp":1648993087120},"reference-count":22,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0012-365x(03)00289-9","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:09:00Z","timestamp":1062601740000},"page":"117-127","source":"Crossref","is-referenced-by-count":5,"title":["Maximum genus and chromatic number of graphs"],"prefix":"10.1016","volume":"271","author":[{"given":"Yuanqiu","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00289-9_BIB1","unstructured":"D. Archdeacon, R. Nedela, M. \u0160koviera, Maximum genus, connectivity, and Nebesky's theorem, Manuscript, 1997."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(03)00289-9_BIB3","unstructured":"G. Chartrand, L. Lesniak, Graphs & Digraphs, 1986."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB4","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(03)00289-9_BIB5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(95)00070-D","article-title":"A tight lower bound on the maximum genus of a simplicial graph","volume":"156","author":"Chen","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1002\/jgt.3190030409","article-title":"A class of upper-embeddable graphs","volume":"3","author":"Jaeger","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00289-9_BIB7","first-page":"401","article-title":"A characterization of upper embeddable graphs","volume":"214","author":"Jungerman","year":"1978","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB8","unstructured":"S.P. Kanchi, J. Chen, Tight lower bound on the maximum genus of a 2-connected simplicial graph, manuscript, 1992."},{"issue":"106","key":"10.1016\/S0012-365X(03)00289-9_BIB9","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","article-title":"A new characterization of the maximum genus of a graph","volume":"31","author":"Nebesk\u00fd","year":"1981","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190050211","article-title":"Every connected, locally connected graph is upper embeddable","volume":"5","author":"Nebesk\u00fd","year":"1981","journal-title":"J. Graph Theory"},{"issue":"110","key":"10.1016\/S0012-365X(03)00289-9_BIB11","doi-asserted-by":"crossref","first-page":"162","DOI":"10.21136\/CMJ.1985.102005","article-title":"On the locally quasiconnected graphs and their upper embeddability","volume":"35","author":"Nebesk\u00fd","year":"1985","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB12","doi-asserted-by":"crossref","first-page":"731","DOI":"10.21136\/CMJ.1991.102504","article-title":"N2-locally connected graph and their upper embeddability","volume":"41","author":"Nebesk\u00fd","year":"1991","journal-title":"J. Czechoslovak Math. J."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB13","series-title":"Topics in Combinatorics and Graph Theory","first-page":"519","article-title":"On upper embeddable graphs with short faces","author":"Nedela","year":"1990"},{"key":"10.1016\/S0012-365X(03)00289-9_BIB14","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(03)00289-9_BIB15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(91)90046-5","article-title":"The maximum genus of graph of diameter two","volume":"87","author":"\u0160koviera","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB16","first-page":"541","article-title":"The maximum genus of a graph and doubly Eulerian trail","volume":"4 B","author":"\u0160koviera","year":"1990","journal-title":"Bull. U.M.I."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB17","series-title":"Graphs, Groups and Surfaces","author":"White","year":"1973"},{"key":"10.1016\/S0012-365X(03)00289-9_BIB18","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\/S0012-365X(03)00289-9_BIB19","doi-asserted-by":"crossref","unstructured":"Yuanqiu Huang, The maximum genus of a 3-vertex-connected graph, Graphs Combin. 16 (2000) 159\u2013164.","DOI":"10.1007\/s003730070022"},{"key":"10.1016\/S0012-365X(03)00289-9_BIB20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0012-365X(96)00299-3","article-title":"Maximum genus and maximum nonseparating independent set of a 3-regular graph","volume":"176","author":"Huang","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB21","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0012-365X(98)00037-5","article-title":"The maximum genus of graphs with diameter three","volume":"194","author":"Huang","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00289-9_BIB22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0012-365X(98)00152-6","article-title":"Maximum genus and girth of graphs","volume":"194","author":"Huang","year":"1999","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002899?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002899?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T13:39:34Z","timestamp":1623332374000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0012365X03002899"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00289-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}