General Mathematics · Unit 4 · Graphs and networks · Planar graphs, paths and cycles

Solve practical problems involving semi-Hamiltonian graphs and Hamiltonian graphs (by trial-and-error methods only). General Mathematics 2025 v1.3

Practise this objective

AI-marked practice questions tied to QCAA mark schemes for this exact LO. Free to start.

Practice questions for this objective

Full questions, answers and worked solutions unlock when you start a free practice session.

Question 1

A delivery company wants to plan a route that visits all five distribution centres (A, B, C, D, E) exactly once and returns to the starting point. The network below shows the direct roads between centres. Which route represents a Hamiltonian cycle starting and ending at A?

Worked answer

🔒 Start free to see full answer

Unlock all 1 answers — free

More in Planar graphs, paths and cycles

← Previous

Solve practical problems involving semi-Eulerian graphs and Eulerian graphs.

Solve practical problems to determine the shortest path between two vertices in a weighted graph (by trial-and-error methods only).

All LOs in Planar graphs, paths and cycles Back to full General Mathematics syllabus