Backtracking

Generate a graph with a Hamiltonian cycle: a route that visits every vertex exactly once and returns to its starting vertex.

Enter a whole number from 6 to 10.

8 vertices · 15 edges

Graph with 8 vertices and a Hamiltonian cycleVertices: 1, 2, 3, 4, 5, 6, 7, 8. Undirected edges: 1–3, 1–6, 2–3, 2–6, 2–7, 2–8, 3–7, 3–8, 4–5, 4–6, 4–7, 4–8, 5–6, 5–8, 7–8.12345678