Pages that link to "Item:Q266791"

The following pages link to An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791):

Displaying 2 items.

• The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
• Hamiltonian (s, t)-paths in solid supergrid graphs (Q6495481) (← links)