# Take Me Back To Kindergarten

Given a graph with $n$ vertices and two colors, we want to determine if we can color each vertex such that no two neighboring vertices have the same color. Which way of traversing the graph makes sense for solving this problem?

Relevant graph algorithms:

×