Spanning closed trails in graphs
Let G be a 2-edge-connected simple graph on n>;95 vertices. Let l be the number of vertices of degree 2 in G. We prove that if l
Chen, Zhi-Hong, "Spanning closed trails in graphs" Discrete Mathematics 117/1-3 (1993): 57-71.
Available at https://digitalcommons.butler.edu/facsch_papers/1194