Reconfiguring Hamiltonian cycles in L-shaped grid graphs

DOI10.1007/978-3-030-30786-8_25OpenAlexW2972941522MaRDI QIDQ2301553

Rahnuma Islam Nishat, S. H. Whitesides

Publication date: 24 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-30786-8_25

zbMATH Keywords

algorithmHamilton cyclegrid graphreconfiguration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids ⋮ Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time ⋮ Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs ⋮ The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs ⋮ The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs ⋮ A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes ⋮ Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

This page was built for publication: Reconfiguring Hamiltonian cycles in L-shaped grid graphs