The icosahedral graph is Hamiltonian, meaning that it contains a Hamiltonian cycle, or a cycle that visits each vertex exactly once.
The icosahedral graph is Hamiltonian, meaning that it contains a Hamiltonian cycle, or a cycle that visits each vertex exactly once.