Hamiltonian Paths and Cycles is a part of the VCE Further Maths topic Networks and Decision Mathematics. It is a part of the subtopic Exploring and Travelling Problems. A Hamiltonian Path passes through every vertex of a graph once and once only. A Hamiltonian Cycle is a path that starts and finishes at the same vertex.
What is a Hamiltonian Path and Cycle?
Watch this video to have all your questions answered.
This next video introduces graphs.
Want to learn more? Check out more of our VCE Mathematics resources here!