Cita APA

Allen, P., Böttcher, J., Lang, R. J., Skokan, J., & Stein, M. J. (2024). Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles.

Citación estilo Chicago

Allen, Peter, Julia Böttcher, Richard Johannes|||0000-0002-7661-934X Lang, Jozef Skokan, y Maya Jakobine Stein. Partitioning a 2-edge-coloured Graph of Minimum Degree 2n/3+o(n) Into Three Monochromatic Cycles. 2024.

Cita MLA

Allen, Peter, et al. Partitioning a 2-edge-coloured Graph of Minimum Degree 2n/3+o(n) Into Three Monochromatic Cycles. 2024.