Pages that link to "Item:Q998354"
From MaRDI portal
The following pages link to Hamiltonian properties of triangular grid graphs (Q998354):
Displayed 24 items.
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- Word-representability of face subdivisions of triangular grid graphs (Q343715) (← links)
- Hamiltonian paths in some classes of grid graphs (Q442933) (← links)
- The Hamiltonian properties of supergrid graphs (Q497690) (← links)
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs (Q2026347) (← links)
- The complexity of quantum circuit mapping with fixed parameters (Q2102776) (← links)
- Hamilton-connectivity of line graphs with application to their detour index (Q2142513) (← links)
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications (Q2144878) (← links)
- Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice (Q2306596) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
- Domination with decay in triangular matchstick arrangement graphs (Q2357662) (← links)
- A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
- Restrained domination and its variants in extended supergrid graphs (Q2699221) (← links)
- An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
- (Q4691817) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- Hamiltonian paths in \(L\)-shaped grid graphs (Q5964021) (← links)
- The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs (Q6102214) (← links)
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (Q6107029) (← links)
- 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
- A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes (Q6175567) (← links)