Let G be a connected graph with at least one cycle. Proof that G is biparthite when no cycle is odd

53 Views Asked by At

So i have this task i am a little bit lost how to approach this problem.

Could anyone guide me trough it?

Let G be a connected graph with at least one cycle. Proof that G is bipartite when no cycle is odd.