{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:10:14Z","timestamp":1770322214032,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T00:00:00Z","timestamp":1435104000000},"content-version":"tdm","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":[[2016,8]]},"DOI":"10.1007\/s00493-015-3186-8","type":"journal-article","created":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T09:41:20Z","timestamp":1435138880000},"page":"451-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths"],"prefix":"10.1007","volume":"36","author":[{"given":"Daniela","family":"K\u00fchn","sequence":"first","affiliation":[]},{"given":"Deryk","family":"Osthus","sequence":"additional","affiliation":[]},{"given":"Timothy","family":"Townsend","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"3186_CR1","volume-title":"The solution of the El-Zahar Problem","author":"S Abbasi","year":"1998","unstructured":"S. Abbasi: The solution of the El-Zahar Problem, Ph.D. Thesis, Rutgers University 1998."},{"key":"3186_CR2","first-page":"2151","volume":"249","author":"P Camion","year":"1959","unstructured":"P. Camion: Chemins et circuits hamiltoniens des graphes complets, C. R. Acad. Sci.Paris 249 (1959), 2151\u20132152.","journal-title":"C. R. Acad. Sci.Paris"},{"key":"3186_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1006\/jctb.2001.2048","volume":"83","author":"G Chen","year":"2001","unstructured":"G. Chen, R.J. Gould and H. Li: Partitioning vertices of a tournament into independentcycles, J. Combin. Theory B 83 (2001), 213\u2013220.","journal-title":"J. Combin. Theory B"},{"key":"3186_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02579344","volume":"3","author":"P Hajnal","year":"1983","unstructured":"P. Hajnal: Partition of graphs with condition on the connectivity and minimumdegree, Combinatorica 3 (1983), 95\u201399.","journal-title":"Combinatorica"},{"key":"3186_CR5","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1016\/j.jctb.2008.12.004","volume":"99","author":"P Keevash","year":"2009","unstructured":"P. Keevash and B. Sudakov: Triangle packings and 1-factors in oriented graphs, J. Combin. Theory B 99 (2009), 709\u2013727.","journal-title":"J. Combin. Theory B"},{"key":"3186_CR6","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1112\/plms\/pdu019","volume":"109","author":"D K\u00dcuhn","year":"2014","unstructured":"D. K\u00dcuhn, J. Lapinskas, D. Osthus and V. Patel: Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments, Proc. London Math Soc. 109 (2014), 733\u2013762.","journal-title":"Proc. London Math Soc."},{"key":"3186_CR7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0304-0208(08)73025-1","volume":"27","author":"K B Reid","year":"1985","unstructured":"K. B. Reid: Two complementary circuits in two-connected tournaments, in: Cycles in Graphs, B.R. Alspach, C.D. Godsil, Eds., Ann. Discrete Math. 27 (1985), 321\u2013334.","journal-title":"Cycles in Graphs, B.R.^Alspach, C.D.^Godsil, Eds., Ann. Discrete Math"},{"key":"3186_CR8","first-page":"466","volume":"576","author":"K B. Reid","year":"1989","unstructured":"K. B. Reid: Three problems on tournaments, Graph Theory and its applications:East and West, Ann. New York Acad. Sci. 576 (1989), 466\u2013473.","journal-title":"Graph Theory and its applications:East and West"},{"key":"3186_CR9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1006\/jctb.1993.1002","volume":"57","author":"Z M","year":"1993","unstructured":"Z. M. Song: Complementary cycles of all lengths in tournaments, J. Combin. Theory B 57 (1993), 18\u201325.","journal-title":"J. Combin. Theory B"},{"key":"3186_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/jgt.3190070204","volume":"7","author":"C Thomassen","year":"1983","unstructured":"C. Thomassen: Graph decomposition with constraints on the connectivity and minimumdegree, J. Graph Theory 7 (1983), 165\u2013167.","journal-title":"J. Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3186-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3186-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3186-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:52Z","timestamp":1559093572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3186-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,24]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["3186"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3186-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,24]]}}}