{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T06:16:25Z","timestamp":1770358585354,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":3791,"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":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00251-2","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T16:05:14Z","timestamp":1035821114000},"page":"261-273","source":"Crossref","is-referenced-by-count":41,"title":["Finding paths in graphs avoiding forbidden transitions"],"prefix":"10.1016","volume":"126","author":[{"given":"Stefan","family":"Szeider","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20133","key":"10.1016\/S0166-218X(02)00251-2_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0012-365X(97)00274-4","article-title":"Alternating cycles and trails in 2-edge-coloured complete multigraphs","volume":"188","author":"Bang-Jensen","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00251-2_BIB2","series-title":"Digraphs: Theory, Algorithms, Applications, Monographs in Mathematics","author":"Bang-Jensen","year":"2000"},{"key":"10.1016\/S0166-218X(02)00251-2_BIB3","doi-asserted-by":"crossref","unstructured":"R. Diestel, Graph theory, 2nd Edition, Graduate Texts in Mathematics, Vol. 173, Springer, New York, 2000.","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"10.1016\/S0166-218X(02)00251-2_BIB4","unstructured":"H. Fleischner, personal communication."},{"key":"10.1016\/S0166-218X(02)00251-2_BIB5","unstructured":"H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 1, Annals of Discrete Mathematics, Vol. 45, Elsevier Science Publishers, North-Holland, Amsterdam, 1990."},{"key":"10.1016\/S0166-218X(02)00251-2_BIB6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0095-8956(90)90080-J","article-title":"On circuit decomposition of planar Eulerian graphs","volume":"50","author":"Fleischner","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00251-2_BIB7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(87)90066-9","article-title":"Compatible path-cycle-decompositions of plane graphs","volume":"42","author":"Fleischner","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"10.1016\/S0166-218X(02)00251-2_BIB8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TSE.1976.233819","article-title":"On two problems in the generation of program test paths","volume":"SE-2","author":"Gabow","year":"1976","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0166-218X(02)00251-2_BIB9","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(02)00251-2_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0166-218X(92)90257-B","article-title":"Compatible 2-factors","volume":"36","author":"Kratochv\u0131\u0301l","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00251-2_BIB11","unstructured":"S. Szeider, On theorems equivalent with Kotzig's result on graphs with unique 1-factors, submitted for publication."},{"key":"10.1016\/S0166-218X(02)00251-2_BIB12","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, Data Structures and Network Algorithms, Regional Conference Series in Applied Mathematics, Vol. 44, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"10.1016\/S0166-218X(02)00251-2_BIB13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Can. J. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002512?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002512?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T09:38:12Z","timestamp":1580895492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02002512"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00251-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}