scientific article

From MaRDI portal

Revision as of 12:28, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3772257

Jump to:navigation, search

zbMath0634.05052MaRDI QIDQ3772257

No author found.

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decompositions grid graphs rectangular grids linear algorithm finding Hamiltonian paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

The number of Hamiltonian paths in a rectangular grid ⋮ 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids ⋮ 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 ⋮ Not being (super)thin or solid is hard: A study of grid Hamiltonicity ⋮ Watchman routes under limited visibility ⋮ Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3772257&oldid=17316218"