4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$

Sean Kim, Michael Picollelli

Open Access

https://doi.org/10.37236/12623

Copy DOI

Journal: Electronic Journal of Combinatorics	Publication Date: Jun 28, 2024
License type: cc-by

Abstract

4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$

Full Text

Published version (

Free)

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Paper Title

Journal

Date

Author