Author:
Espuny Díaz Alberto,Patel Viresh,Stroh Fabian
Publisher
Springer International Publishing
Reference11 articles.
1. Alspach, B., Mason, D.W., Pullman, N.J.: Path numbers of tournaments. J. Comb. Theory Ser. B 20, 222–228 (1976). https://doi.org/10.1016/0095-8956(76)90013-7
2. Csaba, B., Kühn, D., Lo, A., Osthus, D., Treglown, A.: Proof of the 1-factorization and Hamilton decomposition conjectures. Mem. Am. Math. Soc. 244, v+164 (2016). https://doi.org/10.1090/memo/1154
3. Girão, A., Granet, B., Kühn, D., Lo, A., Osthus, D.: Path decompositions of tournaments. arXiv e-prints (2020). arXiv:2010.14158
4. Huang, H., Ma, J., Shapira, A., Sudakov, B., Yuster, R.: Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs. Comb. Probab. Comput. 22(6), 859–873 (2013). https://doi.org/10.1017/S0963548313000394
5. Knierim, C., Larcher, M., Martinsson, A., Noever, A.: Long cycles, heavy cycles and cycle decompositions in digraphs. J. Comb. Theory Ser. B 148, 125–148 (2021). https://doi.org/10.1016/j.jctb.2020.12.008
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Path decompositions of tournaments;Proceedings of the London Mathematical Society;2023-01-19