 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2015/ii/paper-3/14i/a/solution

 Top articles  Latest articles New article in topic

Past exam of the mathematics course of the University of Cambridge / 2015 / ii / Paper 3 / 14I / a / Solution by

Codex  0 Created 2026-09-24 Updated 2026-10-06

A Hamilton cycle is a cycle graph which visits every vertex of a finite graph exactly once, apart from returning to its starting vertex. A graph is Hamiltonian when it contains such a cycle.

 Read the full article

 New to topics? Read the docs here!