Perfect matchings of cellular graphs
From MaRDI portal
Publication:1915154
DOI10.1023/A:1022408900061zbMath0856.05080OpenAlexW2109934391MaRDI QIDQ1915154
Publication date: 11 June 1996
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022408900061
Related Items
Asymptotics of random domino tilings of rectangular Aztec diamonds ⋮ A quadratic identity for the number of perfect matchings of plane graphs ⋮ An extension of the Lindström-Gessel-Viennot theorem ⋮ A complementation theorem for perfect matchings of graphs having a cellular completion ⋮ A bijection proving the Aztec diamond theorem by combing lattice paths ⋮ On the dimer problem of the vertex-edge graph of a cubic graph ⋮ Augmented Aztec bipyramid and dicube tilings ⋮ Off-diagonally symmetric domino tilings of the Aztec diamond ⋮ Generalized domino-shuffling. ⋮ Laurent biorthogonal polynomials, \( q\)-Narayana polynomials and domino tilings of the Aztec diamonds ⋮ Multiply-refined enumeration of alternating sign matrices ⋮ Domino tilings of Aztec octagons ⋮ Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers ⋮ Graphical condensation for enumerating perfect matchings ⋮ Constant term formulas for refined enumerations of Gog and Magog trapezoids ⋮ Computations versus bijections for tiling enumeration ⋮ Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model ⋮ Graphical condensation of plane graphs: a combinatorial approach
Cites Work
