We prove that every finite simple graph can be drawn in the plane so that any two vertices have an integral distance if and only if they are adjacent. The proof is constructive.
|Number of pages||5|
|Journal||Journal of Combinatorial Theory. Series A|
|Publication status||Published - 1997 Nov|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics