Thin Hamiltonian cycles on Archimedean graphs (Q1891368): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0195-6698(95)90057-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005607761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The boundary characteristic and Pick's theorem in the Archimedean planar tilings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pick's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Hamiltonian cycles in a squared rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix method for counting Hamiltonian cycles on grid graphs / rank
 
Normal rank

Latest revision as of 14:42, 23 May 2024

scientific article
Language Label Description Also known as
English
Thin Hamiltonian cycles on Archimedean graphs
scientific article

    Statements

    Thin Hamiltonian cycles on Archimedean graphs (English)
    0 references
    0 references
    0 references
    30 May 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    Archimedean graphs
    0 references
    Archimedean tiling
    0 references
    area functions
    0 references
    graph invariants
    0 references
    thin Hamiltonian cycle
    0 references
    0 references