Abstract
We show in this paper that every strong local tournament with minimum out-degree 3, except the digraphs \(D^3_7\) and \(D^3_8\), contains two vertex-disjoint cycles of different lengths.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availibility statement
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Abreu, M., Aldred, E.L., Funk, M., Jackson, B., Labbate, D., Sheehan, J.: Graphs and digraphs with all 2-factors isomorphic. J. Combin. Theory Ser. B 92, 395–404 (2004)
Bang-Jensen, J., Gutin, G.: Digraphs. Theory, Algorithms and Applications. Springer, New York (2001)
Bang-Jensen, J., Havet, F.: Tournaments and semicomplete digraphs. In: Bang-Jensen, J., Gutin, G. (eds.) Classes of Directed Graphs, pp. 35–124. Springer, New York (2018)
Bensmail, J., Harutyunyan, A., Le, N.K., Li, B., Lichiardopol, N.: Disjoint cycles of different lengths in graphs and digraphs. Electron. J. Combin. 24, Article P4.37 (2017)
Gao, Y., Ma, D.: Disjoint cycles with different length in 4-arc-dominated digraphs. Oper. Res. Lett. 41, 650–653 (2013)
He, Z., Cheng, P., Gao, Y.: Disjoint cycles of different lengths in 3-regular digraphs. Graphs Combin. 38(3), Article 74 (2022)
Henning, M.A., Yeo, A.: Vertex disjoint cycles of different length in digraphs. SIAM J. Discrete Math. 26, 687–694 (2012)
Hung, L.X., Hieu, D.D., Tan, N.D.: Vertex-disjoint cycles of different lengths in multipartite tournaments. Discrete Math. 345, Article 112819 (2022)
Lichiardopol, N.: Proof of a conjecture of Henning and Yeo on vertex-disjoint directed cycles. SIAM J. Discrete Math. 28, 1618–1627 (2014)
Steiner, R.M.: Disjoint cycles with length constraints in digraphs of large connectivity or large minimum degree. SIAM J. Discrete Math. 36(2), 1343–1362 (2022)
Tan, N.D.: Vertex disjoint cycles of different lengths in \(d\)-arc-dominated digraphs. Oper. Res. Lett. 42, 351–354 (2014)
Tan, N.D.: On vertex disjoint cycles of different lengths in 3-regular digraphs. Discrete Math. 338, 2485–2491 (2015)
Tan, N.D.: On 3-regular digraphs without vertex disjoint cycles of different lengths. Discrete Math. 340, 1933–1943 (2017)
Tan, N.D.: On 3-regular digraphs of girth 4. Discrete Math. 342, Article 111632 (2020)
Tan, N.D.: Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths. SIAM J. Discrete Math. 35(1), 485–494 (2021)
Tan, N.D.: A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths. Discussiones Math. Graph Theory 43, 573–581 (2023)
Thomassen, C.: Disjoint cycles in digraphs. Combinatorica 3, 393–396 (1983)
Yeo, A.: Semicomplete multipartite digraphs. In: Bang-Jensen, J., Gutin, G. (eds.) Classes of Directed Graphs, pp. 297–340. Springer, New York (2018)
Funding
The authors declare that no funds, grants or other support were received during the preparation of this article.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
The authors also declare that they have no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Hung, L.X., Tan, N.D. Vertex-Disjoint Cycles of Different Lengths in Local Tournaments. Graphs and Combinatorics 39, 92 (2023). https://doi.org/10.1007/s00373-023-02686-0
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-023-02686-0