Let G be a graph whose odd cycles are pairwise intersecting, meaning that every two

odd cycles have at least one common vertex. Prove that &(G) <= 5.

Let &(G) denote the chromatic number of G.

If someone could show this, it's greatly appreciated... Thanks!!