On the chromatic number of plane tilings
From MaRDI portal
Publication:4668459
DOI10.1017/S1446788700013574zbMATH Open1081.05022WikidataQ29999677 ScholiaQ29999677MaRDI QIDQ4668459FDOQ4668459
Authors: D. Coulson
Publication date: 19 April 2005
Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)
Recommendations
Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cites Work
Cited In (17)
- On the chromatic number of an infinitesimal plane layer
- Title not available (Why is that?)
- Tiling the plane with hexagons: improved separations for \(k\)-colourings
- An estimate for the chromatic number of the space $ \mathbb R^4$
- The chromatic number of the taxicab plane
- Note on the Chromatic Number of Minkowski Planes: The Regular Polygon Case
- Chromatic Numbers of Specified Isohedral Tilings
- The vector graph and the chromatic number of the plane, or how not to prove that \(\chi(\mathbb E^2)>4\)
- The chromatic number of the plane is at least 5: a new proof
- The chromatic number of the plane: the bounded case
- On the enumeration of homeochromatic classes of \(k\)-chromatic tilings
- The chromatic number of the Minkowski plane -- the regular polygon case
- Title not available (Why is that?)
- Triangle colorings require at least seven colors
- Nonemptiness problems of plane square tiling with two colors
- Coloring the Voronoi tessellation of lattices
- An 18-colouring of 3-space omitting distance one
This page was built for publication: On the chromatic number of plane tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4668459)