Hamiltonian cycles in T-graphs
From MaRDI portal
Publication:1580773
DOI10.1007/s004540010051zbMath0953.05040MaRDI QIDQ1580773
John R. Reay, Tudor I. Zamfirescu
Publication date: 23 January 2001
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010051
05C45: Eulerian and Hamiltonian graphs
Related Items
The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs, 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids, A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes, Hamiltonian cycles in linear-convex supergrid graphs, The Hamiltonian properties of supergrid graphs, Hamiltonian properties of triangular grid graphs, The Hamiltonian connectivity of rectangular supergrid graphs, Rikudo is NP-complete