✦ LIBER ✦

On the Chromatic Number of Subsets of the Euclidean Plane

✍ Scribed by M. Axenovich, J. Choi, M. Lastrina, T. McKay, J. Smith…

Book ID: 120788789
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 419 KB
Volume: 30
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1249-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number of finite system

On the chromatic number of finite systems of subsets

✍ D. A. Shabanov 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 389 KB

On the chromatic numbers of spheres in E

On the chromatic numbers of spheres in Euclidean spaces

✍ A. M. Raigorodskii 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 215 KB

On the chromatic numbers of small-dimens

On the chromatic numbers of small-dimensional Euclidean spaces

✍ A.B. Kupavskii; A.M. Raigorodskii 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the chromatic number of Euclidean spa

On the chromatic number of Euclidean space and the Borsuk problem

✍ A. M. Raigorodskii; I. M. Shitova 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 471 KB

The List-Chromatic Number of Infinite Gr

The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces

✍ Péter Komjáth 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 223 KB

On the d-distance face chromatic number

On the d-distance face chromatic number of plane graphs

✍ Mirko Horňák; Stanislav Jendrol' 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

The d-distance face chromatic number of a connected plane graph G is the minimum number of colours in such a colouring of faces of G that whenever two distinct faces are at the distance at most d, they receive distinct colours. We estimate the d-distance face chromatic number from above for connecte