{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:49:53Z","timestamp":1787503793639,"version":"build-2736575974"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T00:00:00Z","timestamp":1473984000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00493-016-3328-7","type":"journal-article","created":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T05:44:24Z","timestamp":1474004664000},"page":"697-732","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Compatible Hamilton cycles in Dirac graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Michael","family":"Krivelevich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Choongbum","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,16]]},"reference":[{"key":"3328_CR1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-P","volume":"11","author":"N. Alon","year":"1997","unstructured":"N. Alon and G. Gutin: Properly colored Hamilton cycles in edge-colored complete graphs, Random Struct. Algor.\n11 (1997), 179\u2013186.","journal-title":"Random Struct. Algor."},{"key":"3328_CR2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BF02756791","volume":"23","author":"B. Bollob\u00e1s","year":"1976","unstructured":"B. Bollob\u00e1s and P. Erd\u0151s: Alternating hamiltonian cycles, Israel J. Math.\n23 (1976), 126\u2013131.","journal-title":"Israel J. Math."},{"key":"3328_CR3","first-page":"5","volume-title":"Handbook of Combinatorics","author":"J. Bondy","year":"1995","unstructured":"J. Bondy: Paths and cycles, in: Handbook of Combinatorics, Vol. 1 (edited by R. Graham, M. Grotschel, and L. Lov\u00e1sz), Elsevier, Amsterdam (1995), 5\u2013110."},{"key":"3328_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00208-008-0268-6","volume":"343","author":"J. B\u00f6ttcher","year":"2009","unstructured":"J. B\u00f6ttcher, M. Schacht and A. Taraz: Proof of the bandwidth conjecture of Bollob\u00e1s and Koml\u00f3s, Mathematische Annalen\n343 (2009), 175\u2013205.","journal-title":"Mathematische Annalen"},{"key":"3328_CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0095-8956(76)90053-8","volume":"21","author":"C. Chen","year":"1976","unstructured":"C. Chen and D. Daykin: Graphs with Hamiltonian cycles having adjacent lines different colors, J. Combin. Theory B\n21 (1976), 135\u2013139.","journal-title":"J. Combin. Theory B"},{"key":"3328_CR6","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.jctb.2011.10.005","volume":"102","author":"D. Christofides","year":"2012","unstructured":"D. Christofides, D. K\u00fchn and D. Osthus: Edge-disjoint Hamilton cycles in graphs, J. Combin. Theory B\n102 (2012), 1035\u20131060.","journal-title":"J. Combin. Theory B"},{"key":"3328_CR7","doi-asserted-by":"crossref","unstructured":"B. Csaba, D. K\u00fchn, A. Lo, D. Osthus and A. Treglown: Proof of the 1-factorization and Hamilton decomposition conjectures, Mem. Amer. Math. Soc., to appear.","DOI":"10.1007\/978-88-7642-475-5_76"},{"key":"3328_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00493-009-2360-2","volume":"29","author":"B. Cuckler","year":"2009","unstructured":"B. Cuckler and J. Kahn: Hamiltonian cycles in Dirac graphs, Combinatorica\n29 (2009), 299\u2013326.","journal-title":"Combinatorica"},{"key":"3328_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0095-8956(76)90007-1","volume":"20","author":"D. E. Daykin","year":"1976","unstructured":"D. E. Daykin: Graphs with cycles having adjacent lines different colors, J. Combin. Theory B\n20 (1976), 149\u2013152.","journal-title":"J. Combin. Theory B"},{"key":"3328_CR10","doi-asserted-by":"crossref","unstructured":"A. Ferber, M. Krivelevich and B.Sudakov: Counting and packing Hamilton cycles in dense graphs and oriented graph, J. Combin. Theory B, to appear.","DOI":"10.1016\/j.jctb.2016.06.001"},{"key":"3328_CR11","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ejc.2013.09.005","volume":"36","author":"P. Heinig","year":"2014","unstructured":"P. Heinig: On prisms, M\u00f6bius ladders and the cycle space of dense graphs, European J. Combin.\n36 (2014), 503\u2013530.","journal-title":"European J. Combin."},{"key":"3328_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(199811)29:3<167::AID-JGT4>3.0.CO;2-O","volume":"29","author":"J. Koml\u00f3s","year":"1998","unstructured":"J. Koml\u00f3s, G. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: On the P\u00f3sa-Seymour conjecture, J. Graph Theory\n29 (1998), 167\u2013176.","journal-title":"J. Graph Theory"},{"key":"3328_CR13","first-page":"76","volume":"18","author":"A. Kotzig","year":"1968","unstructured":"A. Kotzig: Moves without forbidden transitions in a graph, Matematicky \u010dasopis\n18 (1968), 76\u201380.","journal-title":"Matematicky \u010dasopis"},{"key":"3328_CR14","doi-asserted-by":"crossref","first-page":"3095","DOI":"10.1090\/S0002-9947-2014-05963-1","volume":"366","author":"M. Krivelevich","year":"2014","unstructured":"M. Krivelevich, C. Lee and B. Sudakov: Robust Hamiltonicity of Dirac graphs, Trans. Amer. Math. Soc.\n366 (2014), 3095\u20133130.","journal-title":"Trans. Amer. Math. Soc."},{"key":"3328_CR15","doi-asserted-by":"crossref","unstructured":"M. Krivelevich, C. Lee and B. Sudakov: Compatible Hamilton cycles in random graphs, Random Struct. Algor., to appear.","DOI":"10.1002\/rsa.20636"},{"key":"3328_CR16","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.aim.2013.01.005","volume":"237","author":"D. K\u00fchn","year":"2013","unstructured":"D. K\u00fchn and D. Osthus: Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments, Adv. Math.\n237 (2013), 62\u2013146.","journal-title":"Adv. Math."},{"key":"3328_CR17","doi-asserted-by":"crossref","unstructured":"A. Lo: Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Combinatorica, to appear.","DOI":"10.1007\/s00493-015-3067-1"},{"key":"3328_CR18","volume-title":"Combinatorial problems and exercises","author":"L. Lov\u00e1sz","year":"2007","unstructured":"L. Lov\u00e1sz: Combinatorial problems and exercises, 2nd ed., American Mathematical Soc., Providence (2007).","edition":"2"},{"key":"3328_CR19","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"L. P\u00f3sa","year":"1976","unstructured":"L. P\u00f3sa: Hamiltonian circuits in random graphs, Discrete Math.\n14 (1976), 359\u2013364.","journal-title":"Discrete Math."},{"key":"3328_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(79)90020-7","volume":"25","author":"J. Shearer","year":"1979","unstructured":"J. Shearer: A property of the colored complete graph, Discrete Mathematics\n25 (1979), 175\u2013178.","journal-title":"Discrete Mathematics"},{"key":"3328_CR21","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/rsa.20235","volume":"33","author":"B. Sudakov","year":"2008","unstructured":"B. Sudakov and V. Vu: Local resilience of graphs, Random Struct. Algor.\n33 (2008), 409\u2013433.","journal-title":"Random Struct. Algor."},{"key":"3328_CR22","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0095-8956(78)90037-0","volume":"25","author":"D. Woodall","year":"1978","unstructured":"D. Woodall: A sufficient condition for Hamiltonian circuits, J. Combin. Theory B\n25 (1978), 184\u2013186.","journal-title":"J. Combin. Theory B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3328-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3328-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3328-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T07:00:46Z","timestamp":1504767646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3328-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,16]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["3328"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3328-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,16]]}}}