KIM, S.; PICOLLELLI, M. 4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$. The Electronic Journal of Combinatorics, v. 31, n. 2, p. P2.58, 28 Jun. 2024.