Talk:Unit disk graph

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

"Every unit distance graph..."

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 K_1,k for a large k is a unit distance graph but not a unit disk graph. — Miym (talk) 01:15, 31 December 2008 (UTC)[reply]

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)[reply]