Question 1
A graph has an Euler circuit if
◦ it is connected and has an even number of vertices.
◦ it is connected and every vertex has even degree.
◦ every vertex has even degree.
◦ it is connected and has an even number of edges.
◦ none of these
Question 2
A graph without an Euler circuit but with an Euler path
◦ must be connected and have exactly two vertices of odd degree.
◦ must be connected and have exactly one vertex of odd degree.
◦ must be connected and every vertex must have even degree.
◦ must be connected and every vertex must have odd degree.
◦ none of these