(New page: 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 ...) |
|||
| Line 2: | Line 2: | ||
take into account the path (a,b,d,c,e), which visits each vertex exactly once. Therefore the graph has a Hamilton path. | 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... | ||
Latest revision as of 06:02, 20 November 2008
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...
