Hamiltonian cycleHamiltonianCycle2001-10-24 13:12:002008-12-14 23:33:09DefinitionGraph\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}Let $G$ be a graph. If there is a cycle visiting all vertices of $G$ exactly once, we say that the cycle is a \emph{Hamiltonian cycle}. A graph having a Hamiltonian cycle is called a \emph{Hamiltonian graph}.