1.
Kim S, Picollelli M. 4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$. Electron. J. Combin. [Internet]. 2024Jun.28 [cited 2026Mar.27];31(2):P2.58. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i2p58