Search for question
Question

3. Prove that any connected graph with minimum degree no less than 3 contains at least three distinct cycles. [5 marks]

Fig: 1