Hamiltonian path

A Hamiltonian cycle in a dodecahedron. Like all platonic solids, the dodecahedron is Hamiltonian.

The Herschel graph is the smallest possible polyhedral graph that does not have a Hamiltonian cycle.

In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian path that is a cycle. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem, which is NP-complete.

单词	Hamiltonian tour
释义	Hamiltonian tour 英语百科 Hamiltonian path In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian path that is a cycle. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem, which is NP-complete.
随便看	lock for obstetric forceps,supplementary lock for panic doors lock for screw keys lock for sweep lock for vehicles with provision for sealing Lock Forward lock frame lock free retainer lock free system lock from lock front lockgate Lock gate lock gate hatch Lock gates lock gate seal lock gear lock granularity lock hangar Lockhart lockhart and martinelli correlation Lockhartia Lockhart, Mt. Lockhart R. Lockhart River Aboriginal Reserve

Hamiltonian tour

Hamiltonian path