The following pages link to (Q5408279):
Displaying 15 items.
- Some new characterizations of Hamiltonian cycles in triangular grid graphs (Q908287) (← links)
- A matrix method for counting Hamiltonian cycles on grid graphs (Q1329078) (← links)
- Hamiltonian cycles on random lattices of arbitrary genus (Q1571922) (← links)
- A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs (Q1708388) (← links)
- Enumeration of Hamiltonian circuits in rectangular grids (Q1921464) (← links)
- Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs (Q2027316) (← links)
- Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs (Q2115888) (← links)
- 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids (Q2154081) (← links)
- Bend complexity and Hamiltonian cycles in grid graphs (Q2412428) (← links)
- Exact enumeration of Hamiltonian walks on the \(4\times 4\times 4\) cube and applications to protein folding (Q2871959) (← links)
- (Q3621130) (← links)
- (Q3980663) (← links)
- Enumeration of Hamiltonian cycles on a thick grid cylinder - part I: Non-contractible Hamiltonian cycles (Q5028793) (← links)
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (Q6107029) (← links)
- The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs (Q6169406) (← links)
