Hamiltonian paths and cycles

NP-hard problem in combinatorial optimization

sequence of moves of a knight on a chessboard to visit each square exactly once

path in a graph that visits each vertex exactly once

the problem of finding a simple path of maximum length in a given graph

computational problem in graph theory

theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle

bipartite undirected 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

cubic graph with 46 vertices and 69 edges

graph that contains cycles of all possible lengths from three up to the number of vertices in the graph

mathematical notation for cubic Hamiltonian graphs

Mathematical game

on Hamiltonian cycles in planar graphs

conjecture in graph theory

unsolved problem in graph theory