### 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 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Journal of Combinatorial Theory. Series A*,

*80*(2), 290-294. https://doi.org/10.1006/jcta.1997.2826

**Every Graph Is an Integral Distance Graph in the Plane.** / Maehara, Hiroshi; Ota, Katsuhiro; Tokushige, Norihide.

Research output: Contribution to journal › Article

*Journal of Combinatorial Theory. Series A*, vol. 80, no. 2, pp. 290-294. https://doi.org/10.1006/jcta.1997.2826

}

TY - JOUR

T1 - Every Graph Is an Integral Distance Graph in the Plane

AU - Maehara, Hiroshi

AU - Ota, Katsuhiro

AU - Tokushige, Norihide

PY - 1997/11

Y1 - 1997/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0039472085&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039472085&partnerID=8YFLogxK

U2 - 10.1006/jcta.1997.2826

DO - 10.1006/jcta.1997.2826

M3 - Article

VL - 80

SP - 290

EP - 294

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 2

ER -