Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.
From MaRDI portal
Publication:1401370
DOI10.1016/S0304-3975(02)00496-6zbMath1052.68102OpenAlexW2157024420MaRDI QIDQ1401370
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00496-6
Related Items (12)
Decomposition theorem on matchable distributive lattices ⋮ Domino tilings and related models: Space of configurations of domains with holes ⋮ Peripheral convex expansions of resonance graphs ⋮ An algorithm to generate exactly once every tiling with lozenges of a domain. ⋮ On the perfect matching graph defined by a set of cycles ⋮ Non-matchable distributive lattices ⋮ Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph ⋮ Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs ⋮ Structure and enumeration results of matchable Lucas cubes ⋮ The \(B\)-model connection and mirror symmetry for Grassmannians ⋮ Fibonacci-like cubes as \(Z\)-transformation graphs ⋮ Counting Certain Pairings in Arbitrary Groups
Cites Work
This page was built for publication: Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.
