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

MaRDI QIDQ6462935zbMATH OpenFDO

Authors Sean Kim, Michael E. Picollelli

Publication date 10 December 2023

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

This page was built for publication: 4-Chromatic Graphs Have At Least 4 Cycles of Length $0 \bmod 3$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6462935)