Title of article :
Every Graph Is an Integral Distance Graph in the Plane
Author/Authors :
Maehara، نويسنده , , Hiroshi and Ota، نويسنده , , Katsuhiro and Tokushige، نويسنده , , Norihide، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Pages :
5
From page :
290
To page :
294
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.
Journal title :
Journal of Combinatorial Theory Series A
Serial Year :
1997
Journal title :
Journal of Combinatorial Theory Series A
Record number :
1530256
Link To Document :
بازگشت