Hamiltonian path

Target entity: Hamiltonian path
Context triple: [Hamiltonian cycle, relatedConcept, Hamiltonian path]

• A. Eulerian trail
  An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
• B. Hamiltonian cycle concept
  The Hamiltonian cycle concept is a fundamental idea in graph theory describing a cycle that visits each vertex of a graph exactly once and returns to the starting point.
• C. Orientzyklus
  Orientzyklus is a series of adventure novels by Karl May set in the Middle East, featuring the narrator Kara Ben Nemsi and his companion Hadschi Halef Omar.
• D. Seven Bridges of Königsberg problem
  The Seven Bridges of Königsberg problem is a historic puzzle in graph theory that asks whether one can walk through the city of Königsberg crossing each of its seven bridges exactly once, leading Euler to found the field of topology.
• E. Erdős–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Hamiltonian path
Target entity description: A Hamiltonian path is a route through a graph that visits each vertex exactly once without necessarily returning to the starting point.

• A. Eulerian trail
  An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
• B. Hamiltonian cycle concept
  The Hamiltonian cycle concept is a fundamental idea in graph theory describing a cycle that visits each vertex of a graph exactly once and returns to the starting point.
• C. Orientzyklus
  Orientzyklus is a series of adventure novels by Karl May set in the Middle East, featuring the narrator Kara Ben Nemsi and his companion Hadschi Halef Omar.
• D. Seven Bridges of Königsberg problem
  The Seven Bridges of Königsberg problem is a historic puzzle in graph theory that asks whether one can walk through the city of Königsberg crossing each of its seven bridges exactly once, leading Euler to found the field of topology.
• E. Erdős–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• F. None of above. chosen