Solution
= Solution
{c}
\b[True.] Label the vertices $1,\ldots,n$. The cycle $1,2,\ldots,n,1$ uses existing edges of the <complete graph> and visits every vertex once before returning. It is a <Hamiltonian cycle> for every $n\geq3$.
= Solution
{c}
\b[True.] Label the vertices $1,\ldots,n$. The cycle $1,2,\ldots,n,1$ uses existing edges of the <complete graph> and visits every vertex once before returning. It is a <Hamiltonian cycle> for every $n\geq3$.