Hamiltonian (s, t)-paths in solid supergrid graphs (Q6495481): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Not being (super)thin or solid is hard: A study of grid Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the longest path problem in solid grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the longest cycle problem in solid grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for constructing Hamiltonian paths in meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of triangular grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in linear-convex supergrid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian properties of supergrid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian connectivity of rectangular supergrid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6104844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-line exploration of rectangular cellular environments with a rectangular obstacle / 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: A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A condition on Hamilton-connected line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular 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: Hamiltonian cycles in T-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey on path and cycle embedding in some networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:36, 3 December 2024

scientific article; zbMATH DE number 7841117
Language Label Description Also known as
English
Hamiltonian (s, t)-paths in solid supergrid graphs
scientific article; zbMATH DE number 7841117

    Statements

    Hamiltonian (s, t)-paths in solid supergrid graphs (English)
    0 references
    30 April 2024
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references