Kim, S., and M. Picollelli. “4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$”. The Electronic Journal of Combinatorics, Vol. 31, no. 2, June 2024, p. P2.58, doi:10.37236/12623.