Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Hamiltonian path · Vinony

EntityQ273037· pop 34· linked from 325 articles

Hamiltonian path

Sign in to save

path in a graph that visits each vertex exactly once

Connections

strongly connected component

International Standard Book Number

digital object identifier

William Rowan Hamilton

Seven Bridges of Königsberg

Abraham de Moivre

algebraic structure

travelling salesperson problem

Categories

Computational problems in graph theory Graph theory objects Hamiltonian paths and cycles NP-complete problems William Rowan Hamilton

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.35

Entitydist 0.45

graph traversal

Entitydist 0.49

Entitydist 0.49

Entitydist 0.50

Entitydist 0.53

Entitydist 0.54

Entitydist 0.55

Entitydist 0.56

Road coloring problem

Entitydist 0.58

feedback vertex set

Entitydist 0.59

Entitydist 0.62

What links here325 pages

glossary of graph theory terms

polyhedral graph

hypohamiltonian graph

Goldner–Harary graph

hypercube graph

Steinhaus–Johnson–Trotter algorithm

travelling salesperson problem

regular dodecahedron

Hamiltonian path problem

Fleischner's theorem