Walks, trails, paths, circuits and cycles Problem set A Answers

A–D–B–C; A–D–E–C (2 paths)

A–C–E–F–A; A–F–E–C–A (2 cycles)

1. (a) Circuit
2. (b) Path
3. (c) Walk
4. (d) Cycle

1. (a) A and B
2. (b) For example A–E–C–D–E–F–A–B

1. (a) A–B–C–F; A–E–B–F
2. (b) A–B–E–D–A; A–D–E–B–A

1. (a) Degrees: A 4, B 2, C 4, D 2, E 4, F 2
2. (b) For example A–F–E–A–B–C–D–E–C–A
3. (c) No: it is a circuit, and A, C and E are visited more than once

1. (a) Route 1 and Route 2
2. (b) Route 2

1. (a) 6
2. (b) 12

1. (a) A–E–D–A–B–F–C–B–E–F
2. (b) A–E–D–A–B–F–C–B–E–F–A