Every graph is an integral distance graph in the plane
From MaRDI portal
(Redirected from Publication:1374191)
For a finite subset of the plane the pairs of points for which their euclidean distance is an integer defines the corresponding integral distance graph. It is shown that every finite simple graph may be represented in such a way.
Recommendations
Cites work
Cited in
(12)- A cycle-space invariant of the \(<2\)-distance-graph in the plane
- Note on integral distances
- Every 3-colorable graph has a faithful representation in the odd-distance graph
- The odd-distance plane graph
- Odd wheels are not odd-distance graphs
- scientific article; zbMATH DE number 48481 (Why is no real title available?)
- scientific article; zbMATH DE number 179280 (Why is no real title available?)
- Distance Graphs on the Integers
- scientific article; zbMATH DE number 1439469 (Why is no real title available?)
- scientific article; zbMATH DE number 4196001 (Why is no real title available?)
- Plane integral drawings of planar graphs
- Integral and rational graphs in the plane
This page was built for publication: Every graph is an integral distance graph in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374191)