Solution Manual: Pearls In Graph Theory

Can we color the vertices of a planar graph with four colors such that no two adjacent vertices have the same color?