1 Recall Tree Connected Graph Cycles Show Every Tree Colored Two Colors Two Adjacent Verti Q37134229

1. Recall that a tree is a connected graph that has no cycles. Show that every tree can be colored with two colors so that no two adjacent vertices have the same color Show that any graph consisting of a single cycle, with an odd number of vertices, requires exactly three colors to color it so that no two adjacent vertices have the same color. That is, the coloring cannot be

OR

 

OR