Every Graph Is an Integral Distance Graph in the Plane

Hiroshi Maehara; Katsuhiro Ota; Norihide Tokushige

doi:10.1006/jcta.1997.2826

Every Graph Is an Integral Distance Graph in the Plane

Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

5 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 language	English
Pages (from-to)	290-294
Number of pages	5
Journal	Journal of Combinatorial Theory. Series A
Volume	80
Issue number	2
DOIs	https://doi.org/10.1006/jcta.1997.2826
Publication status	Published - 1997 Nov

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1006/jcta.1997.2826

Cite this

@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 = nov,

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

AN - SCOPUS:0039472085

SN - 0097-3165

VL - 80

SP - 290

EP - 294

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

IS - 2

ER -

Every Graph Is an Integral Distance Graph in the Plane

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this