The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs (Q6646753)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs |
scientific article; zbMATH DE number 7952419
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs |
scientific article; zbMATH DE number 7952419 |
Statements
The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs (English)
0 references
3 December 2024
0 references
reconfiguration algorithm
0 references
Hamiltonian paths
0 references
simple paths
0 references
rectangular grid graphs
0 references
optimal-time algorithm
0 references
lower bound
0 references
solution-space graph
0 references
0 references
0 references
0 references
0 references
