Category
page 1Hamiltonian paths and cycles
travelling salesperson problem
NP-hard problem in combinatorial optimization
knight's tour
sequence of moves of a knight on a chessboard to visit each square exactly once
Hamiltonian path
path in a graph that visits each vertex exactly once
longest path problem
the problem of finding a simple path of maximum length in a given graph
Hamiltonian path problem
computational problem in graph theory
Ore's theorem
theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
Herschel graph
bipartite undirected graph
hypohamiltonian graph
graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian
Tutte graph
cubic graph with 46 vertices and 69 edges
pancyclic graph
graph that contains cycles of all possible lengths from three up to the number of vertices in the graph
LCF notation
mathematical notation for cubic Hamiltonian graphs
Icosian game
Mathematical game
Grinberg's theorem
on Hamiltonian cycles in planar graphs
Tait's conjecture
conjecture in graph theory
Barnette's conjecture
unsolved problem in graph theory