FeaturesHow It WorksFor ParentsPricingContactLog inStart free — no credit card needed →

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

Understand the meaning of Eulerian trail, semi-Eulerian graph, Eulerian circuit and Eulerian graph, and the conditions for their existence.

Practise this objective

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

Start free practice

Practice questions for this objective

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

Question 1

The diagram shows a network of five walking tracks connecting four viewing platforms (F, G, H, J) at a nature reserve. Determine the degree of each vertex, then identify whether this network is Eulerian, semi-Eulerian, or neither. Justify your response.

Worked answer
🔒 Start free to see full answer
Question 2

A town council is planning a maintenance route for their street sweeper. The network below shows the streets connecting five intersections: \(A\) (Airport Road), \(F\) (Fire Station), \(H\) (Hospital), \(L\) (Library), and \(M\) (Market Square). Which statement correctly describes this network?

Worked answer
🔒 Start free to see full answer
Question 3

A council is planning walking routes through a botanical garden. The network diagram shows the pathways connecting various garden features. Which statement about the network is correct?

Worked answer
🔒 Start free to see full answer
Question 4

A park has four shelters (A, B, C, D) connected by walking paths as shown in the diagram. Identify whether the graph is Eulerian or semi-Eulerian. Justify your response.

Worked answer
🔒 Start free to see full answer
Question 5

The diagram represents six walkways connecting four picnic shelters (F, G, H, and J) in a park. Identify whether the network is Eulerian or semi-Eulerian. Justify your response.

Worked answer
🔒 Start free to see full answer
Question 6

A network of walking paths connects several monuments in a heritage site. The graph below shows the monuments as vertices and the paths as edges. Which of the following correctly classifies this graph?

Worked answer
🔒 Start free to see full answer
Question 7

Identify whether the graph shown is Eulerian, semi-Eulerian, or neither. Justify your response.

Worked answer
🔒 Start free to see full answer
Question 8

A tourist information centre has created a map showing walking paths connecting six viewing platforms (F, G, H, J, K, L) around a coastal reserve. The table below shows which platforms are directly connected by walking paths. (a) Determine whether the network is Eulerian, semi-Eulerian, or neither. Justify your answer using the degree of each vertex. (2 marks) (b) The centre wants to create a guided tour that uses every path exactly once. Determine whether this is possible, and if so, identify a suitable starting platform. Justify your response. (2 marks)

Worked answer
🔒 Start free to see full answer
Unlock all 8 answers — free

More in Planar graphs, paths and cycles

← Previous
Solve practical problems to determine the shortest path between two vertices in a weighted graph (by trial-and-error methods only).
Next →
Understand the meaning of Hamiltonian path, semi-Hamiltonian graph, Hamiltonian cycle and Hamiltonian graph.
All LOs in Planar graphs, paths and cyclesBack to full General Mathematics syllabus