Every minute wasted is a minute one does not have for other exam problems. Many people do not know the difference between being eulerian and having an eulerian trail. Most people do not know the theorem we proved that was a characterization of graphs having an eulerian trail. I think only one or two people out of 25 mentioned that the G in problem 2 is connected. Very few people know the difference between a comma and a semicolon.
G is bipartite.
The easiest way to show this is just to color 5 vertices black and three white, or so. A couple of people said all cycles in G are even. I do not believe those people carefully looked at ALL possible cycles and verified that all had even length. G has 8 vertices and 11 edges. G does not.