Graph TheoryHardEulerian and Hamiltonian Graphs
Eulerian and Hamiltonian Graphs · Hard problem
Two pentagons (five-cycles) share exactly one common vertex : one pentagon is and the other is , with no other shared vertices or edges ( vertices, edges total). How many Hamiltonian cycles does this graph have?