Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 290-294 |
| Number of pages | 5 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 80 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1997 Nov |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'Every Graph Is an Integral Distance Graph in the Plane'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS