Rhombic penrose tilings can be 3-colored

American Mathematical Monthly

Volumn 107, Issue 3, 2000, Pages 251-253

  Sibley, Tom ^a   Wagon, Stan ^b  

^a Global Business Leadership Department   (United States)

^b MACALESTER COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034344791     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2589317     Document Type: Article

References (8)

1. N. G. de Bruijn and P. Erdos, A colour problem for infinite graphs and a problem in the theory of relations, Indag. Math. 13 (1951) 369-373.
2. M. Gardner, Penrose Tiles to Trapdoor Ciphers, W. H. Freeman, New York, 1989.
3. M. R. Garey and D. S. Johnson, Computers and Intractibility. A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
4. B. Grünbaum and G. C. Shephard, Tilings and Patterns, W. H. Freeman, New York, 1986.
5. J. P. Hutchinson and S. Wagon, Kempe revisited, Amer. Math. Monthly 105 (1998) 170-174.
6. J. O'Rourke, Computational Geometry in C, Cambridge University Press, New York, 1993.
7. S. Wagon, An April Fool's hoax, Mathematica in Education and Research 7:1 (1998) 46-52.
8. S. Wagon, Mathematica in Action, 2nd ed., Springer/TELOS, New York, 1999.