Abstract
We study the perfect matchings in the dual of the square-octagon lattice graph, which can be considered as domino tilings with impurities in some sense. In particular, we show the local move connectedness, that is, if G is a vertex induced finite subgraph which is simply connected, then any perfect matching in G can be transformed into any other perfect matching in G by applying a sequence of local moves each of which involves only two edges.
Original language | English |
---|---|
Pages (from-to) | 1918-1931 |
Number of pages | 14 |
Journal | Discrete Mathematics |
Volume | 310 |
Issue number | 13-14 |
DOIs | |
Publication status | Published - Jul 28 2010 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics