{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:43:44Z","timestamp":1777563824261,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"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":6652,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0166-218x(95)80001-k","type":"journal-article","created":{"date-parts":[[2012,2,20]],"date-time":"2012-02-20T20:09:36Z","timestamp":1329768576000},"page":"203-214","source":"Crossref","is-referenced-by-count":12,"title":["The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs"],"prefix":"10.1016","volume":"59","author":[{"given":"Lars","family":"D\u00f8vling Andersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Fleischner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)80001-K_BIB1","unstructured":"L.D. Andersen, H. Fleischner and S. Regner, Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs, submitted."},{"key":"10.1016\/0166-218X(95)80001-K_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(87)90045-X","article-title":"On non-intersecting Eulerian circuits","volume":"18","author":"Bent","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)80001-K_BIB3","article-title":"The depth-search theorem for planarity","author":"de Freissex","year":"1982"},{"key":"10.1016\/0166-218X(95)80001-K_BIB4","first-page":"33","article-title":"Graphes planaires: reconnaissance et construction de repr\u00e9sentations planaires topologiques","volume":"8","author":"Demoucron","year":"1964","journal-title":"Rev. Fran\u00e7aise Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(95)80001-K_BIB5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler Tours and the Chinese Postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(95)80001-K_BIB6","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degrees of acyclicity for hypergraphs and relational database schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(95)80001-K_BIB7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BF02993540","article-title":"The importance of being Euler","volume":"42","author":"Fleischner","year":"1974","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0166-218X(95)80001-K_BIB8","first-page":"17","volume":"Vol. 2","author":"Fleischner","year":"1983"},{"key":"10.1016\/0166-218X(95)80001-K_BIB9","volume":"Vols. 1 and 2","author":"Fleischner","year":"1990"},{"key":"10.1016\/0166-218X(95)80001-K_BIB10","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(95)80001-K_BIB11","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)80001-K_BIB12","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(95)80001-K_BIB13","series-title":"Reducibility among combinatorial problems","first-page":"85","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(95)80001-K_BIB14","article-title":"Zur Existenz einer speziellen Art von Eulerschen Linien in ebenen Graphen","author":"Regner","year":"1976"},{"key":"10.1016\/0166-218X(95)80001-K_BIB15","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0167-5060(08)70719-2","article-title":"Embedding graphs in the plane \u2014 Algorithmic aspects","volume":"6","author":"Williamson","year":"1980","journal-title":"Ann. Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9580001K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9580001K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T00:50:03Z","timestamp":1543193403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9580001K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0166218X9580001K"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)80001-k","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}