Kim, S., & Picollelli, M. (2024). 4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$. The Electronic Journal of Combinatorics, 31(2), P2.58. https://doi.org/10.37236/12623