This is an old revision of this page, as edited by David Eppstein(talk | contribs) at 22:34, 7 November 2013({{maths rating|class=C|priority=Mid|field=Discrete}} (a little too slim in content to be B class, although it is pretty well organized and sourced)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 22:34, 7 November 2013 by David Eppstein(talk | contribs)({{maths rating|class=C|priority=Mid|field=Discrete}} (a little too slim in content to be B class, although it is pretty well organized and sourced))
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.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
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]
