Talk:Unit disk graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Mathematics (Rated C-class, Mid-priority)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
C Class
Mid Priority
 Field:  Discrete mathematics

"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)