Jump to content

Talk:Unit disk graph

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 05:54, 9 March 2024 (Maintain {{WPBS}}: 1 WikiProject template. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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