3-coloring, no one-color cycle
Source: Kürschák 1997, problem 3
July 15, 2014
combinatorics unsolvedcombinatorics
Problem Statement
Prove that the vertices of any planar graph can be colored with colors such that there is no monochromatic cycle.
Source: Kürschák 1997, problem 3