{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T03:20:05Z","timestamp":1770348005830,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"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":[[1998,6]]},"DOI":"10.1016\/s0012-365x(97)00274-4","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"61-72","source":"Crossref","is-referenced-by-count":16,"title":["Alternating cycles and trails in 2-edge-coloured complete multigraphs"],"prefix":"10.1016","volume":"188","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00274-4_BIB1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0012-365X(96)00160-4","article-title":"Alternating paths and cycles in edge-coloured multigraphs: a survey","volume":"165\u2013166","author":"Bang-Jensen","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00274-4_BIB2","series-title":"Theory of Graphs","first-page":"11","article-title":"Alternating hamiltonian circuit in two-coloured complete graphs","author":"Bankfalvi","year":"1968"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB3","series-title":"Graphs & Digraphs, Pridle, Weber & Schmidt Int. Series","author":"Behzad","year":"1979"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB4","first-page":"190","article-title":"On the complexity of finding alternating hamiltonian and Eulerian cycles in edge-coloured graphs","volume":"vol. 557","author":"Benkouar","year":"1991"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB5","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB6","first-page":"105","article-title":"Pan-alternating cyclic edge-partitioned graphs","volume":"14","author":"Das","year":"1982","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(97)00274-4_BIB7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(83)90016-X","article-title":"Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs","volume":"43","author":"Das","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00274-4_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0166-218X(92)00171-H","article-title":"Hamiltonian circuits determining the order of chromosomes","volume":"50","author":"Dorninger","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)00274-4_BIB9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1038\/hdy.1987.138","article-title":"Geometrical constraints on Bennett's predictions of chromosome order","volume":"58","author":"Dorninger","year":"1987","journal-title":"Heredity"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB10","series-title":"Proc. 16th Annual Symp. Foundations of Computer Science","first-page":"100","article-title":"An O(n2.5)-algorithm for maximum matchings in general graphs","author":"Even","year":"1975"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB11","article-title":"Eulerian graphs and related topics, Part 1","volume":"vol. 45","author":"Fleischner","year":"1990"},{"issue":"No. 1","key":"10.1016\/S0012-365X(97)00274-4_BIB12","first-page":"99","article-title":"A criterion for complete bipartite digraphs to be Hamiltonian","author":"Gutin","year":"1984","journal-title":"Vestsi Acad. Navuk BSSR Ser. Fiz.-Mat. Navuk"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB13","article-title":"Paths and cycles in directed graphs","author":"Gutin","year":"1993"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB14","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/jgt.3190190405","article-title":"Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: a survey","volume":"19","author":"Gutin","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02122681","article-title":"Cycles and paths in bipartite tournaments with spanning configurations","volume":"9","author":"H\u00e4ggkvist","year":"1989","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB16","first-page":"76","article-title":"Moves without forbidden transitions in a graph","volume":"18","author":"Kotzig","year":"1968","journal-title":"Math. Fyz. \u010cazopis"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB17","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0012-365X(97)00274-4_BIB18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1017\/S0963548300002054","article-title":"Finding a longest alternating cycle in a 2-edge-coloured complete graph is in RP","volume":"5","author":"Saad","year":"1996","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0012-365X(97)00274-4_BIB19","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002744?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002744?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T05:20:59Z","timestamp":1556169659000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X97002744"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00274-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}