Pages that link to "Item:Q335338"
From MaRDI portal
The following pages link to Hamiltonian cycles in linear-convex supergrid graphs (Q335338):
Displayed 8 items.
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
- A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
- The restrained domination and independent restrained domination in extending supergrid graphs (Q2695306) (← links)
- Restrained domination and its variants in extended supergrid graphs (Q2699221) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs (Q6102214) (← links)
- A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes (Q6175567) (← links)