Hamiltonian cycles in linear-convex supergrid graphs (Q335338): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6646865 / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonian cycle
Property / zbMATH Keywords: Hamiltonian cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
locally connected
Property / zbMATH Keywords: locally connected / rank
 
Normal rank
Property / zbMATH Keywords
 
linear-convex supergrid graph
Property / zbMATH Keywords: linear-convex supergrid graph / rank
 
Normal rank
Property / zbMATH Keywords
 
supergrid graph
Property / zbMATH Keywords: supergrid graph / rank
 
Normal rank
Property / zbMATH Keywords
 
grid graph
Property / zbMATH Keywords: grid graph / rank
 
Normal rank
Property / zbMATH Keywords
 
triangular grid graph
Property / zbMATH Keywords: triangular grid graph / rank
 
Normal rank
Property / zbMATH Keywords
 
computer sewing machine
Property / zbMATH Keywords: computer sewing machine / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963874483 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1506.00190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in interval graph generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the broadcast independence number of grid graph / 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: The Hamiltonian circuit problem for circle graphs is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bondage number of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of triangular grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination number of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total bondage number of grid 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: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian paths in some classes of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the longest path problem in rectangular grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian disjoint paths problem in grid graphs is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersections of longest cycles in grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in T-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3685231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Properties of Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the longest paths in grid graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:21, 12 July 2024

scientific article
Language Label Description Also known as
English
Hamiltonian cycles in linear-convex supergrid graphs
scientific article

    Statements

    Hamiltonian cycles in linear-convex supergrid graphs (English)
    0 references
    0 references
    2 November 2016
    0 references
    Hamiltonian cycle
    0 references
    locally connected
    0 references
    linear-convex supergrid graph
    0 references
    supergrid graph
    0 references
    grid graph
    0 references
    triangular grid graph
    0 references
    computer sewing machine
    0 references

    Identifiers