Pages that link to "Item:Q1161758"

The following pages link to Hamiltonian circuits on simple 3-polytopes with up to 30 vertices (Q1161758):

Displaying 2 items.

• Hamiltonian cycles in cubic 3-connected bipartite planar graphs (Q801087) (← links)
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices (Q1085184) (← links)