An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. Every graph possesses an integral embedding (Müller 1953, Harborth and Möller 1994).
It is conjectured that every planar graph has a plane integral embedding.
A unit-distance graph is a graph that not only possesses an integral embedding, but an embedding in which all edges have the same length (which can be taken as 1 without loss of generality). Unit-distance embeddings are therefore minimal integral embeddings since they have the smallest possible (1) largest edge length.
The following table summarizes the minimum diameters for integral and plane integral embeddings of the Platonic graphs (Müller
1953, Harborth et al. 1987, Harborth and Möller 1994), where 
refers to the "diameter" given by the largest
integer in the set of lengths of an integral embedding (not the graph
diameter).
| graph |  |  plane |
| cubical graph | 1 | 2 |
| dodecahedral graph | 1 | 2 |
| icosahedral graph | 8 | 159 |
| octahedral graph | 7 | 13 |
| tetrahedral graph | 4 | 17 |
The minimal integral embeddings of the Platonic graphs are illustrated above (Harborth and Möller 1994).
The minimal planar integral embeddings of the Platonic graphs are illustrated above (Harborth et al. 1987).
