Kim, Sean, and Michael Picollelli. “4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$”. The Electronic Journal of Combinatorics 31, no. 2 (June 28, 2024): P2.58. Accessed March 27, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i2p58.