Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs (Q2115888): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_35 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3175978794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Hamiltonian paths in a rectangular grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Milling a Graph with Turn Costs: A Parameterized Complexity Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian paths in \(L\)-shaped grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bend complexity and Hamiltonian cycles in grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring Hamiltonian cycles in L-shaped grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bent Hamilton cycles in \(d\)-dimensional grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Hamiltonian cycle reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792778 / rank
 
Normal rank

Latest revision as of 09:31, 28 July 2024

scientific article
Language Label Description Also known as
English
Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
scientific article

    Statements

    Identifiers