Domino tiling in planar graphs with regular and bipartite dual. (Pavage par des dominos dans des graphes planaires de dual régulier et biparti)

DOI10.1016/0304-3975(95)00206-5zbMath0872.68135OpenAlexW2074536332MaRDI QIDQ1351221

Thomas Chaboud

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00206-5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Fast domino tileability ⋮ Tilings on the butterfly lattice ⋮ Tilings of rectangles with T-tetrominoes ⋮ Tilings with trichromatic colored-edges triangles ⋮ The complexity of generalized domino tilings ⋮ Tile invariants: New horizons. ⋮ An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. ⋮ An optimal algorithm to generate tilings ⋮ Some remarks on sign-balanced and maj-balanced posets

Cites Work

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