paper

Fast regocnition of planar non unit distance graphs

arXiv:1401.4375

Abstract

We study criteria attesting that a given graph can not be embedded in the plane so that neighboring vertices are at unit distance apart and the straight line edges do not cross.

arXiv comment9 pages, 1 table, 5 figures

References in corpus (2)

Cited by in corpus (1)