Line 3: Line 3:
 
The closest I got was one of the path was not covered between C and B. This graph has 2 vertex with odd degree, it should have an Euler path.<br>
 
The closest I got was one of the path was not covered between C and B. This graph has 2 vertex with odd degree, it should have an Euler path.<br>
 
-ngw
 
-ngw
 +
 +
I agree with the Euler Circuit from ngw. There are others though, a > b > f > d > c > e > a for instance.  --rtabchou

Revision as of 17:04, 16 November 2008

The Euler Circuit should be : a -> b -> d -> c-> e-> f ->a.
But for Euler Path, I am still trying to figure out.
The closest I got was one of the path was not covered between C and B. This graph has 2 vertex with odd degree, it should have an Euler path.
-ngw

I agree with the Euler Circuit from ngw. There are others though, a > b > f > d > c > e > a for instance. --rtabchou

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood