Fast regocnition of planar non unit distance graphs

zbMATH Open1332.05046arXiv1401.4375MaRDI QIDQ3464032

Sascha Kurz

Publication date: 20 January 2016

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.

Full work available at URL: https://arxiv.org/abs/1401.4375

zbMATH Keywords

planar graphsgraph embeddingsunit distance graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (2)

A tight bound for the number of edges of matchstick graphs ⋮ Involving \(d\)-convex simple and quasi-simple planar graphs in \(\mathbb R^3\)

This page was built for publication: Fast regocnition of planar non unit distance graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464032)