Foundation to VCE • Explore the maths library • Try a free sample
General Mathematics · Units 3–4 · Outcome 1

Solve travelling or exploring problems using the appropriate traversal concepts.

Key skills

Solve travelling or exploring problems using the appropriate traversal concepts.

The study design publishes this in the combined Units 3–4 list; the stated content applies to Unit 4.

2 focused task setsWorked solutionsPrintable A4 PDF
Full worksheet prepared. Checkout opens soon.Explore the preview and use the related topic collections below.

Build the idea

Eulerian traversal concerns using each edge once; Hamiltonian traversal concerns visiting each vertex once, with return to the start for a cycle. For a connected undirected graph, all degrees even permit an Eulerian circuit, while exactly two odd degrees permit an open Eulerian trail between those vertices. These degree tests do not settle Hamiltonian existence.

Try the sample task

A square A–B–C–D–A also has diagonal AC. List degrees, identify the endpoints of an open Eulerian trail, and give an actual trail using every edge once.

The full worksheet includes the worked solution and remaining task set.

What this activity covers

This focused activity develops the stated idea through one context. It is practice, not evidence that every application or subclause of a broad study-design bullet has been mastered.

Related topic collections