Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01786918n
Noun Concept
SYL
No term available
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
Relations
Sources
IS A
EN
graph
EN
path
HAS PART
EN
Hamiltonian cycle
HAS KIND
EN
wheel graph
EN
ladder graph
EN
Chang graphs
EN
complete bipartite graph
EN
hypercube graph
+4 relations
HAS INSTANCE
EN
Higman–Sims graph
EN
Hall–Janko graph
EN
Foster graph
EN
Möbius–Kantor graph
EN
Shrikhande graph
+82 relations
HAS QUALITY
EN
Hamiltonian cycle
NAMED AFTER
William rowan hamilton
STUDIED BY
EN
graph theory

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License