Tiling with arbitrary tiles (Q3186407): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with polyominoes and combinatorial group theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with sets of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyominoes which tile rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing a rectangle with congruent N-ominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino / rank
 
Normal rank

Revision as of 09:01, 12 July 2024

scientific article
Language Label Description Also known as
English
Tiling with arbitrary tiles
scientific article

    Statements

    Identifiers