Hamiltonian cycle

Let $G$ be a graph. If there is a cycle visiting all vertices of $G$ exactly once, we say that the cycle is a Hamiltonian cycle. A graph having a Hamiltonian cycle is called a Hamiltonian graph.

Title	Hamiltonian cycle
Canonical name	HamiltonianCycle
Date of creation	2013-03-22 11:52:49
Last modified on	2013-03-22 11:52:49
Owner	CWoo (3771)
Last modified by	CWoo (3771)
Numerical id	11
Author	CWoo (3771)
Entry type	Definition
Classification	msc 05C45
Classification	msc 81T70
Classification	msc 81T05
Classification	msc 81T25
Classification	msc 81T20
Classification	msc 81T75
Related topic	HamiltonianGraph
Related topic	HamiltonianPath
Related topic	GraphTheory
Related topic	Traceable