ε-Unit Distance Graphs
✍ Scribed by Geoffrey Exoo
- Book ID
- 106149540
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 336 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The Unit-Distance Graph problem in Euclidean plane asks for the minimum number of colors, so that each point on the Euclidean plane can be assigned a single color with the condition that the points at unit distance apart are assigned different colors. It is well known that this number is between 4 a
Let Un be the infinite graph with n-dimensional rational space Q" as vertex set and two vertices joined by an edge if and only if the distance between them is exactly 1. The connectedness and clique numbers of the graphs U' are discwed. z \* . In this section we shall first prove that U1, U2, U3, a