# On 2D Inverse Problems/Hamiltonian paths

< On 2D Inverse Problems(Redirected from On 2D Inverse Problems/Hamiltonian paths in graphs)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.