{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:59Z","timestamp":1759335839205},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"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":12251,"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":[[1980]]},"DOI":"10.1016\/0012-365x(80)90232-0","type":"journal-article","created":{"date-parts":[[2003,1,10]],"date-time":"2003-01-10T13:08:14Z","timestamp":1042204094000},"page":"249-263","source":"Crossref","is-referenced-by-count":9,"title":["A sequence representation for maps"],"prefix":"10.1016","volume":"30","author":[{"given":"Sostens","family":"Lins","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(80)90232-0_BIB1","series-title":"New Directions in the Theory of Graphs","article-title":"What is a map","author":"Tutte","year":"1971"},{"key":"10.1016\/0012-365X(80)90232-0_BIB2","article-title":"Graphs of maps","author":"Lins","year":"1980"},{"key":"10.1016\/0012-365X(80)90232-0_BIB3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.2307\/2371125","article-title":"On a set of topological invariants for graphs","volume":"35","author":"Whitney","year":"1933","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(80)90232-0_BIB4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/TCT.1966.1082573","article-title":"A simple and efficient algorithm for determining isomorphism of planar triply connected graphs","volume":"13","author":"Weinberg","year":"1966","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0012-365X(80)90232-0_BIB5","series-title":"Complexity of Computer Computations","first-page":"143","article-title":"Isomorphism of planar graphs","author":"Hopcroft","year":"1972"},{"key":"10.1016\/0012-365X(80)90232-0_BIB6","unstructured":"D. Younger, Embeddability in the projective plane, Personal communication."},{"key":"10.1016\/0012-365X(80)90232-0_BIB7","article-title":"The recursive generation of cyclically k-connected cubic planar graphs","author":"Faulkner","year":"1971"},{"key":"10.1016\/0012-365X(80)90232-0_BIB8","series-title":"Graph Theory and Theoritical Physics","first-page":"313","article-title":"The solution of the Heawood map coloring conjecture","author":"Youngs","year":"1967"},{"key":"10.1016\/0012-365X(80)90232-0_BIB9","unstructured":"S. Lins, Generation of cyclically 4-connected projective graphs, to appear in Arts Combinatoria."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80902320?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80902320?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T09:23:01Z","timestamp":1553937781000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X80902320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980]]}},"alternative-id":["0012365X80902320"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(80)90232-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1980]]}}}