MathCastle
Graph TheoryHardEulerian and Hamiltonian Graphs

Eulerian and Hamiltonian Graphs · Hard problem

Two pentagons (five-cycles) share exactly one common vertex cc: one pentagon is c-a1-a2-a3-a4-cc\text{-}a_1\text{-}a_2\text{-}a_3\text{-}a_4\text{-}c and the other is c-b1-b2-b3-b4-cc\text{-}b_1\text{-}b_2\text{-}b_3\text{-}b_4\text{-}c, with no other shared vertices or edges (99 vertices, 1010 edges total). How many Hamiltonian cycles does this graph have?