This set of problems consists of a handful of randomly selected graphs for which the user is to find an Euler circuit or trail (i.e., a walk in the graph that uses every edge exactly once) if it exists. If it does not exist, the user signals this by going on to the next problem. After the problem set is completed, the applet reports how many times the user gave up too soon!
Click on the image below to open this problem set in a new window:
The definitions and notation referenced in these applications are from Discrete Mathematics by Doug Ensley and Winston Crawley, published by John Wiley & Sons, 2005.