{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T18:54:51Z","timestamp":1781722491572,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T00:00:00Z","timestamp":1781654400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T00:00:00Z","timestamp":1781654400000},"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":["12261016"],"award-info":[{"award-number":["12261016"]}],"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":[[2026,8]]},"DOI":"10.1007\/s00373-026-03052-6","type":"journal-article","created":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T18:48:19Z","timestamp":1781722099000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Antidirected Hamilton Paths in k-Hypertournaments"],"prefix":"10.1007","volume":"42","author":[{"given":"Hong","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changchang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jixiang","family":"Meng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,17]]},"reference":[{"key":"3052_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 Verlag, London (2009)","edition":"2"},{"key":"3052_CR2","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Antidirected hamiltonian paths in tournaments. J. Combin. Theory, Ser. B 11, 249\u2013257 (1971)","DOI":"10.1016\/0095-8956(71)90035-9"},{"key":"3052_CR3","doi-asserted-by":"crossref","unstructured":"Rosenfeld, M.: Antidirected hamiltonian paths in tournaments. J. Combin. Theory, Ser. B 12(1), 93\u201399 (1972)","DOI":"10.1016\/0095-8956(72)90035-4"},{"key":"3052_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114331","volume":"348","author":"B Chen","year":"2025","unstructured":"Chen, B., Gerke, S., Gutin, G., et al.: On the $$k$$-anti-traceability of oriented graphs. Discrete Math. 348, 114331 (2025)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"3052_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0166-218X(01)00197-4","volume":"117","author":"P Hell","year":"2002","unstructured":"Hell, P., Rosenfeld, M.: Antidirected hamiltonian paths between specified vertices of a tournament. Discrete Appl. Math. 117(1\u20133), 87\u201398 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"9","key":"3052_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113515","volume":"346","author":"T Klimo\u0161ov\u00e1","year":"2023","unstructured":"Klimo\u0161ov\u00e1, T., Stein, M.: Antipaths in oriented graphs. Discrete Math. 346(9), 113515 (2023)","journal-title":"Discrete Math."},{"issue":"7","key":"3052_CR7","doi-asserted-by":"publisher","first-page":"2018","DOI":"10.1016\/j.disc.2018.02.026","volume":"341","author":"AE Sahili","year":"2018","unstructured":"Sahili, A.E., Aad, M.A.: Antidirected hamiltonian paths and directed cycles in tournaments. Discrete Math. 341(7), 2018\u20132027 (2018)","journal-title":"Discrete Math."},{"key":"3052_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01427945","volume":"201","author":"C Thomassen","year":"1973","unstructured":"Thomassen, C.: Antidirected hamilton circuits and paths in tournaments. Math. Ann. 201, 231\u2013238 (1973)","journal-title":"Math. Ann."},{"key":"3052_CR9","first-page":"39","volume":"7","author":"L R\u00e9dei","year":"1934","unstructured":"R\u00e9dei, L.: Ein kombinatorischer Satz. Acta Litt. Sci. Szeged 7, 39\u201343 (1934)","journal-title":"Acta Litt. Sci. Szeged"},{"key":"3052_CR10","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":"4","key":"3052_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/(SICI)1097-0118(199708)25:4<277::AID-JGT5>3.0.CO;2-H","volume":"25","author":"G Gutin","year":"1997","unstructured":"Gutin, G., Yeo, A.: Hamiltonian paths and cycles in hypertournaments. J. Graph Theory 25(4), 277\u2013286 (1997)","journal-title":"J. Graph Theory"},{"issue":"1","key":"3052_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/jgt.20120","volume":"51","author":"V Petrovi\u0107","year":"2006","unstructured":"Petrovi\u0107, V., Thomassen, C.: Edge-disjoint hamiltonian cycles in hypertournaments. J. Graph Theory 51(1), 49\u201352 (2006)","journal-title":"J. Graph Theory"},{"issue":"4","key":"3052_CR13","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1002\/jgt.20432","volume":"63","author":"J Yang","year":"2010","unstructured":"Yang, J.: Vertex-pancyclicity of hypertournaments. J. Graph Theory 63(4), 338\u2013348 (2010)","journal-title":"J. Graph Theory"},{"issue":"16\u201317","key":"3052_CR14","doi-asserted-by":"publisher","first-page":"2749","DOI":"10.1016\/j.dam.2013.05.036","volume":"161","author":"HW Li","year":"2013","unstructured":"Li, H.W., Li, S.J., Guo, Y.B., et al.: On the vertex-pancyclicity of hypertournaments. Discrete Appl. Math. 161(16\u201317), 2749\u20132752 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"3052_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.4153\/CMB-1966-038-7","volume":"9","author":"JW Moon","year":"1966","unstructured":"Moon, J.W.: On subtournaments of a tournament. Can. Math. Bull. 9(3), 297\u2013301 (1966)","journal-title":"Can. Math. Bull."},{"issue":"2","key":"3052_CR16","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1002\/jgt.22019","volume":"84","author":"M Surmacs","year":"2017","unstructured":"Surmacs, M.: Regular hypertournaments and arc-pancyclicity. J. Graph Theory 84(2), 176\u2013190 (2017)","journal-title":"J. Graph Theory"},{"issue":"1","key":"3052_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113119","volume":"346","author":"L Xiao","year":"2023","unstructured":"Xiao, L.: Arc-pancyclicity of hypertournaments with irregularity at most two. Discrete Math. 346(1), 113119 (2023)","journal-title":"Discrete Math."},{"issue":"6","key":"3052_CR18","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.4134\/JKMS.2014.51.6.1141","volume":"51","author":"Y Guo","year":"2014","unstructured":"Guo, Y., Surmacs, M.: Pancyclic arcs in hamiltonian cycles of hypertournaments. J. Korean Math. Soc. 51(6), 1141\u20131154 (2014)","journal-title":"J. Korean Math. Soc."},{"key":"3052_CR19","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.dam.2016.07.017","volume":"215","author":"HW Li","year":"2016","unstructured":"Li, H.W., Ning, W.J., Guo, Y.B., et al.: On pancyclic arcs in hypertournaments. Discrete Appl. Math. 215, 164\u2013170 (2016)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03052-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03052-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03052-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T18:48:21Z","timestamp":1781722101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03052-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,17]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3052"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03052-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,17]]},"assertion":[{"value":"10 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2026","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 declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"56"}}