On the public citation graph

Hamiltonian Properties of Grid Graphs

https://doi.org/10.1137/0405046
0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02960735openalex-snapshot
Über drei kombinatorische Probleme amn-dimensionalen Würfel und Würfelgitter
inferredcites →https://doi.org/10.1017/s0013091500002753openalex-snapshot
Decomposition of the n -Dimensional Lattice-Graph into Hamiltonian Lines
inferredcites →https://doi.org/10.1137/0211056openalex-snapshot
Hamilton Paths in Grid Graphs
inferredcites →https://doi.org/10.4153/cmb-1965-051-3openalex-snapshot
On Eulerian and Hamiltonian Graphs and Line Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/mma.3301openalex-snapshot
Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
inferred← citeshttps://doi.org/10.1007/978-3-319-60675-0_2openalex-snapshot
Desktop Tower Defense Is NP-Hard
inferred← citeshttps://doi.org/10.1007/978-981-10-7356-4_6openalex-snapshot
Hybrid Mapping for Increased Security
inferred← citeshttps://doi.org/10.1007/s004540010051openalex-snapshot
Hamiltonian Cycles in T-Graphs
inferred← citeshttps://doi.org/10.1007/s10878-024-01207-wopenalex-snapshot
The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs
inferred← citeshttps://doi.org/10.1007/s11227-012-0852-0openalex-snapshot
An efficient parallel algorithm for the longest path problem in meshes
inferred← citeshttps://doi.org/10.1007/s11227-017-1984-zopenalex-snapshot
A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00330-yopenalex-snapshot
The number of Hamiltonian paths in a rectangular grid
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127513openalex-snapshot
Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.020openalex-snapshot
Hamiltonian cycles in linear-convex supergrid graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.06.001openalex-snapshot
The Hamiltonian connectivity of rectangular supergrid graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.024openalex-snapshot
The Hamiltonian properties of supergrid graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.024openalex-snapshot
Hamiltonian paths in L-shaped grid graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.031openalex-snapshot
A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
inferred← citeshttps://doi.org/10.1080/10556788.2018.1460665openalex-snapshot
Longest (s, t)-paths in L-shaped grid graphs
inferred← citeshttps://doi.org/10.1080/10556788.2022.2157001openalex-snapshot
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
inferred← citeshttps://doi.org/10.1109/71.932713openalex-snapshot
Augmented ring networks
inferred← citeshttps://doi.org/10.1109/candar.2015.9openalex-snapshot
The Hamiltonian Property of Linear-Convex Supergrid Graphs
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.124openalex-snapshot
Hardware Supported Adaptive Data Collection for Networks on Chip
inferred← citeshttps://doi.org/10.1155/2012/475087openalex-snapshot
Hamiltonian Paths in Some Classes of Grid Graphs
inferred← citeshttps://doi.org/10.1556/sscmath.36.2000.1-2.15openalex-snapshot
On longest cycles in grid graphs
inferred← citeshttps://doi.org/10.2139/ssrn.7602601openalex-snapshot
Dualing Spirals and Other Infinite Sequences of Composable, Face-Bound, Hamiltonian Cycleson Toroidal Grid-Graphs that Build Hilbert-Style, Square-Filling Curves
inferred← citeshttps://doi.org/10.33044/revuma.4432openalex-snapshot
Hamiltonicity of rectangular grid graphs (meshes) with an L-shaped hole
inferred← citeshttps://doi.org/10.3390/a15020061openalex-snapshot
Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time
inferred← citeshttps://doi.org/10.3390/math11122712openalex-snapshot
The Longest (s, t)-Path Problem on O-Shaped Supergrid Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1107.1780openalex-snapshot
Hamiltonian Paths in Two Classes of Grid Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1602.07407openalex-snapshot
Hamiltonian Paths in C-shaped Grid Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1904.02581openalex-snapshot
The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1911.08558openalex-snapshot
The Longest $(s, t)$-paths of $O$-shaped Supergrid Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0008231openalex-snapshot
Computing and Sampling Restricted Vertex Degree Subgraphs and Hamiltonian Cycles
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.