{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:16Z","timestamp":1740107116513,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,18]],"date-time":"2023-03-18T00:00:00Z","timestamp":1679097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,18]],"date-time":"2023-03-18T00:00:00Z","timestamp":1679097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071260"],"award-info":[{"award-number":["12071260"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00373-023-02631-1","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T01:35:32Z","timestamp":1679880932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partition and Disjoint Cycles in Digraphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Chunjiao","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,18]]},"reference":[{"issue":"2","key":"2631_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jctb.1996.0062","volume":"68","author":"N Alon","year":"1996","unstructured":"Alon, N.: Disjoint directed cycles. J. Combin. Theory Ser. B 68(2), 167\u2013178 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"6","key":"2631_CR2","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1017\/S0963548306008042","volume":"15","author":"N Alon","year":"2006","unstructured":"Alon, N.: Splitting digraphs. Combin. Probab. Comput. 15(6), 933\u2013937 (2006)","journal-title":"Combin. Probab. Comput."},{"issue":"4","key":"2631_CR3","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1137\/18M1186356","volume":"33","author":"Y Bai","year":"2019","unstructured":"Bai, Y., Manoussakis, Y.: On the number of vertex-disjoint cycles in digraphs. SIAM J. Discrete Math. 33(4), 2444\u20132451 (2019)","journal-title":"SIAM J. Discrete Math."},{"key":"2631_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)","edition":"2"},{"issue":"4","key":"2631_CR5","doi-asserted-by":"publisher","first-page":"4.37","DOI":"10.37236\/6921","volume":"24","author":"J Bensmail","year":"2017","unstructured":"Bensmail, J., Harutyunyan, A., Le, N.K., Li, B., Lichiardopol, N.: Disjoint cycles of different lengths in graphs and digraphs. Electron. J. Combin. 24(4), 4.37 (2017)","journal-title":"Electron. J. Combin."},{"issue":"1","key":"2631_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190050102","volume":"5","author":"JC Bermond","year":"1981","unstructured":"Bermond, J.C., Thomassen, C.: Cycles in digraph\u2014a survey. J. Gr. Theory 5(1), 1\u201343 (1981)","journal-title":"J. Gr. Theory"},{"issue":"8","key":"2631_CR7","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1016\/j.disc.2018.04.027","volume":"341","author":"M Buci\u0107","year":"2018","unstructured":"Buci\u0107, M.: An improved bound for disjoint directed cycles. Discrete Math. 341(8), 2231\u20132236 (2018)","journal-title":"Discrete Math."},{"issue":"2","key":"2631_CR8","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/100802463","volume":"26","author":"MA Henning","year":"2012","unstructured":"Henning, M.A., Yeo, A.: Vertex disjoint cycles of different length in digraphs. SIAM J. Discrete Math. 26(2), 687\u2013694 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"2631_CR9","volume-title":"Graph Colouring and the Probabilistic Method, Algorithms and Combinatorics","author":"M Michael","year":"2002","unstructured":"Michael, M., Bruce, R.: Graph Colouring and the Probabilistic Method, Algorithms and Combinatorics. Springer, Berlin (2002)"},{"key":"2631_CR11","first-page":"9","volume":"273416","author":"N Lichiardopol","year":"2012","unstructured":"Lichiardopol, N.: Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz. Int. J. Comb. 273416, 9 (2012)","journal-title":"Int. J. Comb."},{"issue":"3","key":"2631_CR10","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.1137\/130922653","volume":"28","author":"N Lichiardopol","year":"2014","unstructured":"Lichiardopol, N.: Proof of a conjecture of Henning and Yeo on vertex-disjoint directed cycles. SIAM J. Discrete Math. 28(3), 1618\u20131627 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"2631_CR12","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/080715792","volume":"23","author":"N Lichiardopol","year":"2009","unstructured":"Lichiardopol, N., P\u00f3r, A., Sereni, J.-S.: A step toward the Bermond\u2013Thomassen conjecture about disjoint cycles in digraphs. SIAM J. Discrete Math. 23(2), 979\u2013992 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"2631_CR13","volume-title":"Topics on Tournaments","author":"JW Moon","year":"1968","unstructured":"Moon, J.W.: Topics on Tournaments. Holt, Rinehart and Winston, New York (1968)"},{"issue":"3","key":"2631_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H","volume":"23","author":"M Stiebitz","year":"1996","unstructured":"Stiebitz, M.: Decomposing graphs under degree constraints. J. Gr. Theory 23(3), 321\u2013324 (1996)","journal-title":"J. Gr. Theory"},{"issue":"3\u20134","key":"2631_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF02579195","volume":"3","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Disjoint cycles in digraphs. Combinatorica 3(3\u20134), 393\u2013396 (1983)","journal-title":"Combinatorica"},{"key":"2631_CR16","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.ejc.2018.03.005","volume":"71","author":"D Yang","year":"2018","unstructured":"Yang, D., Bai, Y., Wang, G., Wu, J.: On splitting digraphs. Eur. J. Combin. 71, 174\u2013179 (2018)","journal-title":"Eur. J. Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02631-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02631-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02631-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T17:06:02Z","timestamp":1681319162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02631-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,18]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2631"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02631-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,3,18]]},"assertion":[{"value":"7 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"34"}}