Perfect matchings of cellular graphs
From MaRDI portal
Recommendations
- A complementation theorem for perfect matchings of graphs having a cellular completion
- Perfect matchings of polyomino graphs
- Perfect matchings in pruned grid graphs
- Exact perfect matching in complete graphs
- Perfect matchings and derangements on graphs
- Perfect matchings of generalized polyomino graphs
- Graphs of triangulations and perfect matchings
- Perfect matchings of regular bipartite graphs
- Perfect matchings in highly cyclically connected regular graphs
- scientific article; zbMATH DE number 1808637
Cites work
- scientific article; zbMATH DE number 3048077 (Why is no real title available?)
- Alternating sign matrices and descending plane partitions
- Alternating-sign matrices and domino tilings. I
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Determinants and alternating sign matrices
- Remark on the dimer problem
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(25)- On the dimer problem of the vertex-edge graph of a cubic graph
- A bijection proving the Aztec diamond theorem by combing lattice paths
- scientific article; zbMATH DE number 15371 (Why is no real title available?)
- Multiply-refined enumeration of alternating sign matrices
- An extension of the Lindström-Gessel-Viennot theorem
- A complementation theorem for perfect matchings of graphs having a cellular completion
- Generalized domino-shuffling.
- Constant term formulas for refined enumerations of Gog and Magog trapezoids
- Perfect matchings and applications
- Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers
- Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model
- Augmented Aztec bipyramid and dicube tilings
- Channels, billiards, and perfect matching 2-divisibility
- Off-diagonally symmetric domino tilings of the Aztec diamond of odd order
- Laurent biorthogonal polynomials, \( q\)-Narayana polynomials and domino tilings of the Aztec diamonds
- Graphical condensation of plane graphs: a combinatorial approach
- A quadratic identity for the number of perfect matchings of plane graphs
- Perfect matching complexes of honeycomb graphs
- Computations versus bijections for tiling enumeration
- Tilings of benzels via generalized compression
- Graphical condensation for enumerating perfect matchings
- Domino tilings of Aztec octagons
- Off-diagonally symmetric domino tilings of the Aztec diamond
- Asymptotics of random domino tilings of rectangular Aztec diamonds
- Billiards, channels, and perfect matching 2-divisibility
This page was built for publication: Perfect matchings of cellular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1915154)
