GRAPH THEORY: IF A is a graph with no cycles of even length help please :)
QUESTION: Prove that if G is a graph with no cycles of even length, then every cycle in G is an induced sub graph of G.
I can see this when I sketch the graph but writing the proof has caused headaches.