Talk:Unit disk graph
Latest comment: 15 years ago by David Eppstein in topic "Every unit distance graph..."
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
"Every unit distance graph..." edit
The page says: "Every unit distance graph, in which we connect two points in a planar point set if their distance is exactly one, is a unit disk graph". Really? I would have claimed that K1,k for a large k is a unit distance graph but not a unit disk graph. — Miym (talk) 01:15, 31 December 2008 (UTC)
- I probably put that in at some point. I don't know what I was thinking. Removed now, anyway. —David Eppstein (talk) 01:47, 31 December 2008 (UTC)