bn:01786918n
Noun Concept
Categories: William Rowan Hamilton, Hamiltonian paths and cycles, Graph theory objects, NP-complete problems, Computational problems in graph theory
EN
Hamiltonian path  Hamiltonian graph  Bondy-Chvatal theorem  Bondy-Chvátal theorem  Bondy and Chvatal's theorem
EN
In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once. Wikipedia
A path in a graph that visits each vertex exactly once Wikipedia Disambiguation
Path in a graph that visits each vertex exactly once Wikidata
Graph containing a Hamiltonian cycle Wikidata
Graph for which there is a Hamiltonian cycle. Wiktionary (translation)
A graph for which there is a Hamiltonian cycle. Wiktionary
A path through a graph which visits each vertex exactly once. Wiktionary
Path which visits each vertex exactly once. Wiktionary (translation)