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