Every Graph Is an Integral Distance Graph in the Plane

Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige

Research output: Contribution to journalArticle

4 Citations (Scopus)


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 languageEnglish
Pages (from-to)290-294
Number of pages5
JournalJournal of Combinatorial Theory. Series A
Issue number2
Publication statusPublished - 1997 Nov


ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this