{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:07:59Z","timestamp":1758823679055},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0095-8956(90)90074-a","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"198-207","source":"Crossref","is-referenced-by-count":4,"title":["Bidirectional retracting-free double tracings and upper embeddability of graphs"],"prefix":"10.1016","volume":"50","author":[{"given":"Carsten","family":"Thomassen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(90)90074-A_BIB1","author":"Behzad","year":"1979"},{"key":"10.1016\/0095-8956(90)90074-A_BIB2","first-page":"307","article-title":"Double tracings of graphs","volume":"17","author":"Eggleton","year":"1984","journal-title":"Ars Combin. A"},{"key":"10.1016\/0095-8956(90)90074-A_BIB3","series-title":"Selected Topics in Graph Theory","first-page":"17","article-title":"Eulerian graphs","author":"Fleischner","year":"1983"},{"key":"10.1016\/0095-8956(90)90074-A_BIB4","unstructured":"M. L. Furst, J. L. Gross, and L. A. McGeoch, Finding a maximum-genus graph embedding, preprint."},{"key":"10.1016\/0095-8956(90)90074-A_BIB5","first-page":"210","article-title":"Efficient algorithms for graphic matroid intersection and parity","author":"Gabow","year":"1985"},{"key":"10.1016\/0095-8956(90)90074-A_BIB6","series-title":"Algebraic Methods in Graph Theory","article-title":"The matroid matching problem","author":"Lov\u00e1sz","year":"1978"},{"key":"10.1016\/0095-8956(90)90074-A_BIB7","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":"Nebesky","year":"1981","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0095-8956(90)90074-A_BIB8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.21136\/CMJ.1983.101853","article-title":"A note on upper embeddable graphs","volume":"33","author":"Nebesky","year":"1983","journal-title":"Czechoslovak. Math. J."},{"key":"10.1016\/0095-8956(90)90074-A_BIB9","first-page":"49","article-title":"A problem regarding the tracing of graphs","volume":"6","author":"Ore","year":"1951","journal-title":"Elem. Math."},{"key":"10.1016\/0095-8956(90)90074-A_BIB10","unstructured":"C. Thomassen, Graph embeddings and minors, in \u201cHandbook in Combinatorics\u201d (R. L. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz, Eds.), North-Holland, Amsterdam, to appear."},{"key":"10.1016\/0095-8956(90)90074-A_BIB11","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/2315469","article-title":"On traversing graphs","volume":"73","author":"Troy","year":"1966","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0095-8956(90)90074-A_BIB12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into connected factors","volume":"36","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(90)90074-A_BIB13","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 Ser. B"},{"key":"10.1016\/0095-8956(90)90074-A_BIB14","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":"1929","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090074A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090074A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,4]],"date-time":"2021-07-04T22:55:37Z","timestamp":1625439337000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569090074A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["009589569090074A"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(90)90074-a","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}