411 REFERENCE · Wikibooks
On 2D Inverse Problems/Hamiltonian paths
Reference material by Wikibooks contributors. This retains its source identity and is not 411 news reporting.
The existence of the paths in a graph and its dual with the following properties plays an important role in the connection between global and local properties of the graph: Two sets of paths between two subsets of boundary nodes in the graph and its dual are Hamiltonian if the paths go through every interior point of the graph and its dual.
center|300px|The paths go through all vertices of G and G*