This post originally appeared on Arjun Rajkumar's blog. Arjun is a web developer based in Bangalore, India.
Given an undirected graph with maximum degree DD, find a graph coloring using at most D+1 colors.
If you want to follow along, feel free to post your answers in the comment.
My answers are in the comments.
This problem is from InterviewCake.