{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:41Z","timestamp":1765164101947,"version":"3.46.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T00:00:00Z","timestamp":1763337600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T00:00:00Z","timestamp":1763337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Fundamental Research Program of Shanxi Province","award":["202303021221064"],"award-info":[{"award-number":["202303021221064"]}]},{"name":"Fundamental Research Program of Shanxi Province","award":["20210302123202"],"award-info":[{"award-number":["20210302123202"]}]},{"name":"Science and Technology Innovation Teams of Shanxi Province","award":["202204051002015"],"award-info":[{"award-number":["202204051002015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00373-025-02991-w","type":"journal-article","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T10:05:21Z","timestamp":1763373921000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hamiltonian Cycles Avoiding a Spanning Forest or a Spanning Cycle Subgraph in Tournaments"],"prefix":"10.1007","volume":"41","author":[{"given":"Yaoxiang","family":"Di","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8062-3459","authenticated-orcid":false,"given":"Ruijuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xinhong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,17]]},"reference":[{"key":"2991_CR1","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). https:\/\/doi.org\/10.1007\/978-1-84800-998-1","edition":"2"},{"key":"2991_CR2","first-page":"1424","volume":"7","author":"L R\u00e9dei","year":"1934","unstructured":"R\u00e9dei, L.: Ein kombinatorischer satz. Acta. Litt. Sci. Szeged. 7, 1424\u20131428 (1934)","journal-title":"Acta. Litt. Sci. Szeged."},{"key":"2991_CR3","first-page":"2151","volume":"249","author":"P Camion","year":"1959","unstructured":"Camion, P.: Chemins et circuits hamiltoniens des graphes complets. C. R. Acad. Sci. Paris. 249, 2151\u20132152 (1959)","journal-title":"C. R. Acad. Sci. Paris."},{"issue":"1","key":"2991_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1112\/plms\/s3-45.1.151","volume":"45","author":"C Thomassen","year":"1982","unstructured":"Thomassen, C.: Edge-disjoint hamiltonian paths and cycles in tournaments. Proc. London Math. Soc. 45(1), 151\u2013168 (1982). https:\/\/doi.org\/10.1112\/plms\/s3-45.1.151","journal-title":"Proc. London Math. Soc."},{"key":"2991_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01788546","volume":"3","author":"P Fraisse","year":"1987","unstructured":"Fraisse, P., Thomassen, C.: Hamiltonian dicycles avoiding prescribed arcs in tournaments. Graphs Combin. 3, 239\u2013250 (1987). https:\/\/doi.org\/10.1007\/BF01788546","journal-title":"Graphs Combin."},{"issue":"3","key":"2991_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1002\/jgt.22888","volume":"102","author":"J Bang-Jensen","year":"2023","unstructured":"Bang-Jensen, J., Havet, F., Yeo, A.: Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory. 102(3), 578\u2013606 (2023). https:\/\/doi.org\/10.1002\/jgt.22888","journal-title":"J. Graph Theory."},{"key":"2991_CR7","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.dam.2024.10.011","volume":"360","author":"R Li","year":"2025","unstructured":"Li, R., Di, Y., Zhang, R., Niu, Z.: Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs. Discrete Appl. Math. 360, 451\u2013458 (2025). https:\/\/doi.org\/10.1016\/j.dam.2024.10.011","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"2991_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/jgt.23256","volume":"110","author":"R Li","year":"2025","unstructured":"Li, R., Di, Y., Zhang, R., Zhang, X.: A proof to Bang-Jensen-Havet-Yeo\u2019s conjecture on the hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs. J. Graph Theory. 110(2), 145\u2013154 (2025). https:\/\/doi.org\/10.1002\/jgt.23256","journal-title":"J. Graph Theory."},{"issue":"3","key":"2991_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/S0963548397003027","volume":"6","author":"J Bang-Jensen","year":"1997","unstructured":"Bang-Jensen, J., Gutin, G., Yeo, A.: Hamiltonian cycles avoiding prescribed ars in tournaments. Combin. Probab. Comput. 6(3), 255\u2013261 (1997). https:\/\/doi.org\/10.1017\/S0963548397003027","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"2991_CR10","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0095-8956(80)90061-1","volume":"28","author":"C Thomassen","year":"1980","unstructured":"Thomassen, C.: Hamiltonian-connected tournaments. J. Combin. Theory Ser. B. 28(2), 142\u2013163 (1980). https:\/\/doi.org\/10.1016\/0095-8956(80)90061-1","journal-title":"J. Combin. Theory Ser. B."},{"key":"2991_CR11","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s003730050080","volume":"15","author":"A Yeo","year":"1999","unstructured":"Yeo, A.: How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? Graphs and Combin. 15, 481\u2013493 (1999). https:\/\/doi.org\/10.1007\/s003730050080","journal-title":"Graphs and Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02991-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02991-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02991-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:40Z","timestamp":1765164040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02991-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,17]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2991"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02991-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,11,17]]},"assertion":[{"value":"8 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2025","order":3,"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 no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"129"}}