9. A Hamiltonian cycle in a graph is a cycle that starts at some vertex *v*, visits every other vertex exactly once, and ends at *v*. True or false: every graph contains a Hamiltonian cycle.
(A)O
(B)X

相關試題

相關試卷