Return to main page
Exercises
Hamiltonian labelling
In the Fig C is an unlabeled digraph with 6 nodes.
Can the reader apply integer-names from N6 to the nodes so that
1→2→3→4→5→6
is a path in the graph? It is Hamiltonian. Find a second Hamiltonian path containing every node once and only once.