Counting Tilings by Taking Walks in a Graph
From MaRDI portal
Publication:5118416
Recommendations
- Counting tilings by taking walks
- Counting Lattice Walks in the Plane
- Walks on tilings of polygons
- Tilings in graphons
- scientific article; zbMATH DE number 1439433
- scientific article; zbMATH DE number 5139439
- Counting fixed-height tatami tilings
- Tilings in vertex ordered graphs
- Counting lattice walks by winding angle
- The number of walks in a graph
Cites work
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1975686 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 2050057 (Why is no real title available?)
- Alternating-sign matrices and domino tilings. I
- Alternating-sign matrices and domino tilings. II
- Counting tilings by taking walks
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Tiling a strip with triangles
- Tiling with L's and squares
Cited in
(12)- Tiling problems, automata, and tiling graphs
- Counting tilings of the \(n \times m\) grid, cylinder, and torus
- Alternative proofs of a tiling result
- Polynomial sequences of binomial-type arising in graph theory
- Enumerating tilings of rectangles by squares with recurrence relations
- Tilings
- Walks on tiled boards
- Walks on tilings of polygons
- Counting tilings by taking walks
- Self-avoiding walks and polygons on quasiperiodic tilings
- Counting lattice walks by winding angle
- Automatic counting of tilings of skinny plane regions
This page was built for publication: Counting Tilings by Taking Walks in a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118416)