I need to prove that every graph containing only even vertices is bridgeless.
I understand that an even vertex is one with an even degree. Therefore an even vertex is one which is connected to an even number of vertices.
I also understand an edge $e = uv$ in a connected graph G whose removal creates a disconnected graph is a bridge.
I don't know how to use this to do the proof :(