Skip to content

Home Path Worksheets Skill map Leaderboard

Sign in Save your progress

Search topicsCtrl K

Sign in Save your progress

Search

1 of 8 0-day streak

Lesson Practice

Hamiltonian paths and cycles

DIFFICULTYintro standard challenge exam

QUESTION TYPEMix of allChange

path; not asked; compact path path; not asked; meshed path NOWMix of allRecommended

Question 1 of 8

No calculator

Consider the unweighted graph below. Each labelled point represents a vertex, and each line represents an edge

(a)1 mark

Select the sequence that forms a Hamiltonian path

G–B–F–A

C–B–G–F–A

B–C–A–F–G–A

F–B–G–C–A

(b)1 mark

How many edges does the correct route use?

Edges used