scientific article; zbMATH DE number 599152

MaRDI QIDQ4297418zbMATH OpenFDO

Authors Thomas Chaboud

Publication date 22 August 1994

zbMATH Keywords

algorithmbiregular planar graphdominopolyominoThurston's tiling algorithmtiling

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Recommendations

• Tiling pictures of the plane with dominoes
• On the tileability of polygons with colored dominoes
• An O(n n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
• Planar Dimer Tilings
• Domino tiling graphs

Cited in

(7)

• Domino tilings on orientable surfaces
• Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion
• The lattice structure of the set of domino tilings of a polygon
• Domino tilings on planar regions
• scientific article; zbMATH DE number 2087458 (Why is no real title available?)
• scientific article; zbMATH DE number 806590 (Why is no real title available?)
• Simulations between cellular automata on Cayley graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4297418)