Claims

../

1974_12_01_thomassen: Thomassen (Arch. Math. 1974) proves that a graph with n at least 3 vertices and 2n−2 edges has a cycle and a vertex off it joined to three of its vertices, which settles the corrected statement; refereed and site-credited.

---