The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs

DOI10.2298/aadm211211006dzbMath1524.05122arXiv2212.00317OpenAlexW4319779928MaRDI QIDQ6169406

Olga Bodroža-Pantić, Jelena Đokić, Ksenija Doroslovački

Publication date: 11 July 2023

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.00317

zbMATH Keywords

transfer matrix2-factorMoebius stripthick grid cylinder

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating Hamiltonian cycles
• A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs
• Reconfiguring Hamiltonian cycles in L-shaped grid graphs
• Enumeration of Hamiltonian cycles on a thick grid cylinder - part I: Non-contractible Hamiltonian cycles
• Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
• Enumeration of Hamiltonian cycles on a thick grid cylinder - Part II: Contractible Hamiltonian cycles

This page was built for publication: The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs