Pages that link to "Item:Q5006572"

The following pages link to Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles (Q5006572):

Displaying 3 items.

• Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
• Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples (Q5009933) (← links)
• Lower bounds for the algebraic connectivity of graphs with specified subgraphs (Q5061677) (← links)