The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs (Q6169406): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4319779928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Hamiltonian cycles on a thick grid cylinder - part I: Non-contractible Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Hamiltonian cycles on a thick grid cylinder - Part II: Contractible Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6121151 / 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: Reconfiguring Hamiltonian cycles in L-shaped grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Hamiltonian cycles / rank
 
Normal rank

Latest revision as of 17:29, 1 August 2024

scientific article; zbMATH DE number 7710594
Language Label Description Also known as
English
The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs
scientific article; zbMATH DE number 7710594

    Statements

    Identifiers