On coloring planar graphs

Jit Bose

In this talk, we will review a few known results on coloring planar graphs. In particular, we will present a simple proof that every planar graph can be 5 colored. Time permitting, we will also present a proof that every triangle-free planar graph can be 3-colored.