Every Graph Is an Integral Distance Graph in the Plane

Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige

Research output: Contribution to journalArticle

4 Citations (Scopus)

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

Fingerprint

Integral Graphs
Distance Graph
Finite Graph
Simple Graph
Adjacent
If and only if
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

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

In: Journal of Combinatorial Theory. Series A, Vol. 80, No. 2, 11.1997, p. 290-294.

Research output: Contribution to journalArticle

Maehara, Hiroshi ; Ota, Katsuhiro ; Tokushige, Norihide. / Every Graph Is an Integral Distance Graph in the Plane. In: Journal of Combinatorial Theory. Series A. 1997 ; Vol. 80, No. 2. pp. 290-294.
@article{529c31a22e674a9a8c0148722346a684,
title = "Every Graph Is an Integral Distance Graph in the Plane",
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.",
author = "Hiroshi Maehara and Katsuhiro Ota and Norihide Tokushige",
year = "1997",
month = "11",
doi = "10.1006/jcta.1997.2826",
language = "English",
volume = "80",
pages = "290--294",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "2",

}

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 -