A chorded cycle in a graph is a cycle in the graph with oneadditional edge connecting two of the cycle vertices. Prove thatevery graph with minimum degree 3 contains a chorded cycle as asubgraph. (Hint: Consider a longest path in the graph. What does ittell you when a vertex is the end of a longest path? )
