I was asked to prove that a graph can be colored in two colors if and only if the graph does not contain a circle with an odd number of edges. I'd really appreciate some help on this one. Thank you!!!
reminder: graph coloring means: labeling of the graph’s vertices with colors such that no two vertices sharing the same edge have the same color