Hamiltonian cycle


THEOREM    It is decidable whether or not a graph is Hamiltonian.

Proof unavailable

Sage

sage: g = graphs.HeawoodGraph() sage: g.is_hamiltonian() True sage: g = graphs.PetersenGraph() sage: g.is_hamiltonian() False http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/generic_graph.html#sage.graphs.generic_graph.GenericGraph.is_hamiltonian

Parent topics