Pith. sign in

REVIEW

Fast regocnition of planar non unit distance graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1401.4375 v1 pith:ICKNKDJT submitted 2014-01-17 math.CO

Sascha Kurz This is my paper · ORCID
classification math.CO
keywords distanceunitapartattestingcriteriacrossedgesembedded
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools