Tilings with trichromatic colored-edges triangles
From MaRDI portal
Publication:596045
DOI10.1016/j.tcs.2004.02.021zbMath1043.05031OpenAlexW2092207864MaRDI QIDQ596045
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.021
Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items (2)
Triangular covers of a digital object ⋮ A Combinatorial Technique for Construction of Triangular Covers of Digital Objects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domino tiling in planar graphs with regular and bipartite dual. (Pavage par des dominos dans des graphes planaires de dual régulier et biparti)
- An algorithm to generate exactly once every tiling with lozenges of a domain.
- Tiling with polyominoes and combinatorial group theory
- Markov Chain Algorithms for Planar Lattice Structures
- Conway's Tiling Groups
- A constrained Potts antiferromagnet model with an interface representation
This page was built for publication: Tilings with trichromatic colored-edges triangles