{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:09:35Z","timestamp":1773655775801,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/0166-218x(94)90010-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"233-239","source":"Crossref","is-referenced-by-count":2,"title":["An algorithm for an Eulerian trail traversing specified edges in given order"],"prefix":"10.1016","volume":"55","author":[{"given":"Mao-Cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90010-8_BIB1","unstructured":"M.-C. Cai and H. Fleischner, An Eulerian trail traversing specified edges in given order, submitted."},{"key":"10.1016\/0166-218X(94)90010-8_BIB2","author":"Gibbons","year":"1985"},{"key":"10.1016\/0166-218X(94)90010-8_BIB3","first-page":"16","article-title":"Eulerian graphs","author":"Fleischner","year":"1983"},{"key":"10.1016\/0166-218X(94)90010-8_BIB4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jgt.3190120314","article-title":"Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs","volume":"12","author":"Jackson","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)90010-8_BIB5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","article-title":"On some connectivity properties of Eulerian graphs","volume":"28","author":"Lov\u00e1sz","year":"1976","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0166-218X(94)90010-8_BIB6","first-page":"145","article-title":"A reduction method for edge-connectivity in graphs","volume":"3","author":"Mader","year":"1978"},{"key":"10.1016\/0166-218X(94)90010-8_BIB7","author":"Papadimitriou","year":"1982"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:29:58Z","timestamp":1555136998000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0166218X94900108"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90010-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}