Pages that link to "Item:Q2673969"

The following pages link to Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time (Q2673969):

Displaying 7 items.

• An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
• A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
• Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs (Q2115888) (← links)
• A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
• 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (Q6107029) (← links)
• Spanning closed trail and hamiltonian cycle in grid graphs (Q6487981) (← links)
• The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs (Q6646753) (← links)