Author:
Corsten Jan,Mendonça Walner
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference27 articles.
1. Allen, P.: Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles. Combin. Probab. Comput. 17(4), 471–486 (2008)
2. Ayel, J.: Sur l’existence de deux cycles supplémentaires unicolores, disjoints et de couleurs différentes dans un graphe complet bicolore, Theses, Université Joseph-Fourier — Grenoble I, (1979)
3. Bessy, S., Thomassé, S.: Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture. J. Combin. Theory Ser. B 100(2), 176–180 (2010)
4. Böttcher, J., Kohayakawa, Y., Taraz, A., Würfl, A.: An extension of the blow-up lemma to arrangeable graphs. SIAM J. Discrete Math. 29(2), 962–1001 (2015)
5. Bustamante, S., Corsten, J., Frankl, N., Pokrovskiy, A., Skokan, J.: Partitioning hypergraphs into few monochromatic tight cycles. SIAM J. Discrete Math. 34(2), 1460–1471 (2020)