Fast regocnition of planar non unit distance graphs
classification
🧮 math.CO
keywords
distanceunitapartattestingcriteriacrossedgesembedded
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.