Pages that link to "Item:Q501235"
From MaRDI portal
The following pages link to Enumerating independent vertex sets in grid graphs (Q501235):
Displaying 13 items.
- Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices (Q1654390) (← links)
- Domino tilings of the expanded Aztec diamond (Q1699576) (← links)
- State matrix recursion method and monomer-dimer problem (Q1732778) (← links)
- Number of dominating sets in cylindric square grid graphs (Q2042212) (← links)
- Counting dissections into integral squares (Q2113355) (← links)
- Dimer coverings of 1-slab cubic lattices (Q2157838) (← links)
- Enumeration of 1-slab lattice links (Q2315305) (← links)
- Maximal independent sets on a grid graph (Q2404364) (← links)
- Counting Domineering Positions (Q4989362) (← links)
- The Polynomial Profile of Distance Games on Paths and Cycles (Q5042429) (← links)
- A mathematical analysis of mosaic knitting: constraints, combinatorics, and colour-swapping symmetries (Q5047017) (← links)
- Period and toroidal knot mosaics (Q5269129) (← links)
- Enumeration on graph mosaics (Q5269130) (← links)
