Perfect matchings in the triangular lattice

DOI10.1016/0012-365X(94)00304-2zbMath0854.05083MaRDI QIDQ1917494

Eric Rémila, Claire M. Kenyon

Publication date: 13 January 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

tilingtriangular latticeperfect matchinglinear-time algorithmregular planar lattices

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items

The lattice structure of the set of domino tilings of a polygon, Tiling with bars and satisfaction of boolean formulas, Tiling a simply connected figure with bars of length 2 or 3, A variational principle for domino tilings, Local move connectedness of domino tilings with diagonal impurities, Computing large matchings in planar graphs with fixed minimum degree, A bijection theorem for domino tilings with diagonal impurities, Random tilings with the GPU

Cites Work

• Tiling with polyominoes and combinatorial group theory
• Conway's Tiling Groups
• Unnamed Item
• Unnamed Item