Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets
The unit distance graph $G^1_{R^d}$ is the infinite graph whose nodes are points in $R^d$, with an edge between two points if the Euclidean distance between these points is $1$. The 2-dimensional version $G^1_{R^2}$ of this graph is typically studied for its chromatic number, as in the Hadwiger-Nels...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2022-02-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol9/iss1/2 |