Name
Abstract | ||
|---|---|---|
We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in particular, when these polytopes are Gorenstein. We also introduce the notion of domino stackings and present some results and several open questions. Our techniques use results from graph theory, polyhedral geometry, and enumerative combinatorics. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s00373-005-0858-y | Graphs and Combinatorics |
Keywords | Field | DocType |
graph theory,recurrence relation,recurrence relations,domino tiling,rational functions,rational function,ehrhart polynomial | Discrete mathematics,Graph,Computer science,Computer network,Domino,Polytope,Grid | Journal |
Volume | Issue | ISSN |
25 | 4 | Graphs Combin. 25 (2009), 409-426 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Beck | 1 | 12 | 7.42 |
| Christian Haase | 2 | 29 | 3.41 |
| Steven V. Sam | 3 | 20 | 4.36 |