Abstract
We prove that for every graph , given fixed locations for the vertices of in , there is a three-dimensional grid-drawing of with one bend per edge. The best previous bound was three bends per edge.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.