APA (7th ed.) Citation

Lo, A., & Pfenninger, V. (2023). Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles.

Chicago Style (17th ed.) Citation

Lo, Allan, and Vincent Pfenninger. Almost Partitioning Every $2$-edge-coloured Complete $k$-graph into $k$ Monochromatic Tight Cycles. 2023.

MLA (9th ed.) Citation

Lo, Allan, and Vincent Pfenninger. Almost Partitioning Every $2$-edge-coloured Complete $k$-graph into $k$ Monochromatic Tight Cycles. 2023.