Revision as of 06:02, 20 November 2008 by Rveerama (Talk)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Am I doing this right, because this one seems a little too easy the way I did it:

take into account the path (a,b,d,c,e), which visits each vertex exactly once. Therefore the graph has a Hamilton path.


-yes thats right...

Alumni Liaison

Followed her dream after having raised her family.

Ruth Enoch, PhD Mathematics