Hamiltonian graphs

The five graphs are transcribed from Appendix 1 of the original Lab_TCP manual. Crossings are not vertices. Choose graph g = 1 + ((variant − 1) mod 5). A path visits every numbered vertex once; its endpoints need not be connected.

Back to the laboratory

Graph 1

Variants 1, 6, 11, 16, 21, 26 · 6 vertices

123456

Undirected edges: 1–2, 1–3, 1–4, 1–6, 2–3, 2–4, 3–6, 4–5, 4–6, 5–6

Graph 2

Variants 2, 7, 12, 17, 22, 27 · 7 vertices

1234567

Undirected edges: 1–2, 1–4, 1–5, 2–3, 2–6, 2–7, 3–6, 3–7, 4–6, 5–7

Graph 3

Variants 3, 8, 13, 18, 23, 28 · 6 vertices

123456

Undirected edges: 1–2, 1–5, 1–6, 2–3, 2–4, 3–4, 3–6, 4–5, 5–6

Graph 4

Variants 4, 9, 14, 19, 24, 29 · 7 vertices

1234567

Undirected edges: 1–2, 1–3, 1–7, 2–4, 2–5, 3–4, 3–6, 5–6, 5–7, 6–7

Graph 5

Variants 5, 10, 15, 20, 25, 30 · 6 vertices

123456

Undirected edges: 1–2, 1–3, 1–5, 2–4, 2–6, 3–4, 3–5, 4–6, 5–6