{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T14:48:34Z","timestamp":1775486914009,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0012-365x(78)90148-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:00Z","timestamp":1027655100000},"page":"69-74","source":"Crossref","is-referenced-by-count":4,"title":["An additivity theorem for maximum genus of a graph"],"prefix":"10.1016","volume":"21","author":[{"given":"C.H.C.","family":"Little","sequence":"first","affiliation":[]},{"given":"R.D.","family":"Ringeisen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90148-6_bib1","doi-asserted-by":"crossref","first-page":"817","DOI":"10.4153\/CJM-1966-081-6","article-title":"The genus, regional number, and Betti number of a graph","volume":"18","author":"Duke","year":"1966","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(78)90148-6_bib2","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"},{"key":"10.1016\/0012-365X(78)90148-6_bib3","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"},{"key":"10.1016\/0012-365X(78)90148-6_bib4","series-title":"Graph Theory and Applications","article-title":"Upper and lower imbeddable graphs","author":"Ringeisen","year":"1972"},{"key":"10.1016\/0012-365X(78)90148-6_bib5","unstructured":"R.D. Ringeisen, On Additivity in Maximum Genus, Colloque Internationale CNRS, Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes (Univ. of Paris Press, to appear)."},{"key":"10.1016\/0012-365X(78)90148-6_bib6","first-page":"813","article-title":"Sur quelques classes de graphes poss\u00e9dant des propri\u00e9t\u00e9s topologiques remarquables","volume":"283","author":"Xuong","year":"1976","journal-title":"C.R. Acad. Sci. Paris, S\u00e9r. A"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901486?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901486?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:50:46Z","timestamp":1555134646000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78901486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78901486"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90148-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}