maybe someone can help me with the next task. I need to prove that if every vertex of a connected graph with more than three vertices has an even degree, then the graph is a edge-2-connected graph. First of all, I do not understand why this statement is correct. After all, if I take a graph in which all the vertices are connected to each other and each vertex has degree 4, then it obviously cannot be a line 2-connected graph? Or I'm wrong?
Thanks for the tips and ideas!
