Drawing some planar graphs with integer edge-lengths

@inproceedings{Biedl2011DrawingSP,
  title={Drawing some planar graphs with integer edge-lengths},
  author={Therese C. Biedl},
  booktitle={CCCG},
  year={2011}
}
In this paper, we study drawings of planar graphs such that all edge lengths are integers. It was known that such drawings exist for all planar graphs with maximum degree 3. We give a different proof of this result, which is based on a simple transformation of hexagonal drawings as created by Kant. Moreover, if the graph is 3-connected then the vertices have integer coordinates that are in O(n). We then study some other classes of planar graphs, and show that planar bipartite, seriesparallel… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
2 Citations
15 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…