The four color theorem states that all planar graphs have chromatic number at most four. The converse statement is an easier problem to approach: are all graphs with chromatic number at most four planar?

Your answer seems reasonable.
Find out if you're right!