1) Describe a situation where you must use 3 colors for a proper coloring (hint: start with 3 vertices, and see what edges are necessary)

Computer Science Jan 23, 2023

1) Describe a situation where you must use 3 colors for a proper coloring (hint: start with 3 vertices, and see what edges are necessary). 2. How many colors are needed to color a bipartite graph? Explain. (Note: any graph that can be colored with this number, is always bipartite) 3. Prove the following statement: If G is a tree, then G is bipartite. (Hint: how can we avoid using 3 colors?)