{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:40:46Z","timestamp":1698043246616},"reference-count":7,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,11,6]],"date-time":"2006-11-06T00:00:00Z","timestamp":1162771200000},"content-version":"vor","delay-in-days":6094,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1990,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>B. Jackson [4] made the following conjecture: If <jats:italic>G<\/jats:italic> is an Eulerian graph with \u03b4(<jats:italic>G<\/jats:italic>) \u2265 2<jats:italic>k<\/jats:italic>, then <jats:italic>G<\/jats:italic> has a set of 2<jats:italic>k<\/jats:italic> \u2010 2 pairwise compatible Euler cycles (i.e., every pair of adjacent edges appears in at most one of these Euler cycles as a pair of consecutive edges). We verify this conjecture in the case where every circuit of <jats:italic>G<\/jats:italic> is a block of <jats:italic>G<\/jats:italic>.<\/jats:p>","DOI":"10.1002\/jgt.3190140106","type":"journal-article","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T01:17:37Z","timestamp":1181351857000},"page":"51-63","source":"Crossref","is-referenced-by-count":7,"title":["On the maximum number of pairwise compatible euler cycles"],"prefix":"10.1002","volume":"14","author":[{"given":"H.","family":"Fleischner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J. W.","family":"Hilton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Jackson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90077-5"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(87)90066-9"},{"key":"e_1_2_1_4_2","first-page":"233","volume-title":"Progress in Graph Theory","author":"Fleischner H.","year":"1984"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90125-7"},{"key":"e_1_2_1_6_2","first-page":"913","article-title":"Problem session, Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. 2","volume":"24","author":"Kotzig A.","year":"1979","journal-title":"Congressus Numeratium"},{"key":"e_1_2_1_7_2","unstructured":"A.Kotzig Problem 20 Theory of graphs and its applications.Proceedings of the Symposium at Smolenice 1963.Nakl. CSAV Praha (1964) 62."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090104"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190140106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190140106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T18:54:39Z","timestamp":1698000879000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190140106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["10.1002\/jgt.3190140106"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190140106","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}