Straight line embeddings of cubic planar graphs with integer edge lengths

Authors:
Jim Geelen;Anjie Guo;David McKinnon
Affiliations:
Department of Combinatorics and Optimization University of Waterloo, Waterloo Canada N2L 3G1;(Undergraduate Student) Faculty of Mathematics University of Waterloo, Waterloo Canada N2L 3G1;Department of Pure Mathematics University of Waterloo, Waterloo Canada N2L 3G1
Venue:
Journal of Graph Theory
Year:
2008

Citing 0
Cited 5

Orthogonal cartograms with few corners per face

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Drawing planar 3-trees with given face-areas

GD'09 Proceedings of the 17th international conference on Graph Drawing
Integer realizations of disk and segment graphs

Journal of Combinatorial Theory Series B
Drawing planar 3-trees with given face areas

Computational Geometry: Theory and Applications
Orthogonal cartograms with at most 12 corners per face

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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