Definition:Hamilton Cycle

From ProofWiki
Jump to navigation Jump to search


A Hamilton cycle in a graph is a cycle that contains every vertex of the graph (but not necessarily every edge).

Also known as

The term Hamilton cycle is sometimes seen rendered as hamilton cycle, that is, without a capital H.

The longer form Hamiltonian cycle (or hamiltonian cycle) is also sometimes encountered.

Some sources use the term Hamilton (or Hamiltonian) circuit.

Also see

Source of Name

This entry was named for William Rowan Hamilton.