NP-completeness of the Hamiltonian cycle problem

Also called Hamiltonian-cycle NP-completeness.

Shows that deciding whether a graph has a cycle visiting every vertex exactly once is NP-complete, by reduction from vertex cover.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

Ladder	Level	What the next level needs
Human proof	H0 no proof	add a proof in proofs/ (06.5)
Lean	L0 no Lean part	name a Lean module in the lean field (07)
Visual	V0 none	add viz/scene.ts or a figure (10)
Writing	W0 stub	Statement one source with a locator