Tiling a simply connected figure with bars of length 2 or 3

Discrete Mathematics

Volumn 160, Issue 1-3, 1996, Pages 189-198

  Rémila, Eric ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040628263     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(96)00158-6     Document Type: Article

References (9)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974) 179-187.
2. D. Beauquier and M. Nivat, Tiling pictures of the plane with two bars, a horizontal and a vertical one, in: D. Beauquier, ed., Actes du séminaire "Polyominos et pavages" (Université de Créteil, 1991) 37-43.
3. J.H. Conway and J.C. Lagarias, Tiling with polyominoes and combinatorial group theory, J. Combin. Theory A 53 (1990) 183-208.
4. C. Kenyon and R. Kenyon, Tiling a polygon with rectangles, rapport de recherche N° 92-41, Laboratoire de l'Informatique du Parallélisme. Ecole Normale Supérieure de Lyon (1992).
5. C. Kenyon and E. Remila, Perfect matchings in the triangular lattice, preprint.
6. J.C. Lagarias and D.S. Romano, A polyomino tiling of thurston and its configurational entropy, J. Combin. Theory A 63 (1993) 338-358.
7. n est NP-complet, in: D. Beauquier, ed., Actes du séminaire "Polyominos et pavages" (Université de Créteil, 1991) 95-103
8. W.P. Thurston, Conway's tiling group, Amer. Math Monthly (1990) 757-773.
9. 3 rapport de stage de D.E.A. Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon (1993).