Premium
Straight line embeddings of cubic planar graphs with integer edge lengths
Author(s) -
Geelen Jim,
Guo Anjie,
McKin David
Publication year - 2008
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20304
Subject(s) - combinatorics , planar graph , mathematics , polyhedral graph , cubic graph , embedding , planar , planar straight line graph , book embedding , integer (computer science) , enhanced data rates for gsm evolution , graph , line (geometry) , discrete mathematics , line graph , 1 planar graph , geometry , computer science , voltage graph , telecommunications , computer graphics (images) , artificial intelligence , programming language
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008