{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:55:57Z","timestamp":1787324157771,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>M. A. Henning and A. Yeo conjectured in [ SIAM J. Discrete Math., 26 (2012), pp. 687--694] that a bipartite digraph of minimum out-degree at least 3 contains two vertex disjoint directed cycles of different lengths. In this paper, we disprove this conjecture. Further, we classify strong tournaments and strong bipartite tournaments of minimum out-degree 3 without two vertex disjoint directed cycles of different lengths.<\/jats:p>","DOI":"10.1137\/20m1351047","type":"journal-article","created":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T11:16:36Z","timestamp":1616498196000},"page":"485-494","source":"Crossref","is-referenced-by-count":7,"title":["Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths"],"prefix":"10.1137","volume":"35","author":[{"given":"Ngo Dac","family":"Tan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.09.004"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"J. Bang-Jensen and G. Gutin,\n                      Digraphs: Theory, Algorithms and Applications\n                      , Springer, New York, 2001.","DOI":"10.1007\/978-1-4471-3886-0"},{"key":"atypb3","first-page":"35","author":"Bang-Jensen J.","year":"2018","journal-title":"New York"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.37236\/6921"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.09.003"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/100802463"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/130922653"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2014.06.004"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.06.016"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"N. D. Tan,\n                      On 3-regular digraphs without vertex disjoint cycles of different lengths\n                      , Discrete Math., 340 (2017), pp. 1933-1943.","DOI":"10.1016\/j.disc.2017.03.024"},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"N. D. Tan,\n                      On 3-regular digraphs of girth 4\n                      , Discrete Math., 342 (2020), 111632.","DOI":"10.1016\/j.disc.2019.111632"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579195"},{"key":"atypb14","first-page":"297","author":"Yeo A.","year":"2018","journal-title":"New York"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/20M1351047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:19:35Z","timestamp":1787321975000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1351047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1137\/20M1351047"],"URL":"https:\/\/doi.org\/10.1137\/20m1351047","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}