Graph TheoryHardEulerian and Hamiltonian Graphs
Eulerian and Hamiltonian Graphs · Hard problem
The wheel graph has a hub vertex joined to all five rim vertices of a -cycle . Counting two cycles as the same whenever they use the same set of edges, how many distinct Hamiltonian cycles does have?