Related papers: Really Straight Graph Drawings

The paper has been withdrawn by the author, due to it being fundamentally flawed. The author apologizes for any inconvenience it may have caused.

This paper has been withdrawn, because its material has been revised and became part of paper math.GT/0010184

This paper has been withdrawn by the author, due to an error in the proof of Theorem 3.8.

This paper has been withdrawn.

This paper has been withdrawn by the authors. I will do the major revision.

This paper has been withdrawn by the author due to a error in attachment of source file.

The paper is withdrawn by the authors and replaced be an improved and extended version arxiv: 0812.2968

This paper has been withdrawn. Its new version has been published.

This paper has been withdrawn by the authors. Because of a misunderstanding, the paper was submitted prematurely to the arXiv. A replacement will follow.

This paper has been withdrawn by the authors due to an unlikely results.

This paper has been withdrawn by the author due to serious error found in main argument.

This paper has been withdrawn by the authors

The paper has been withdrawn by the authors.

This paper has been withdrawn by the author due to an extended and largely modified version of the paper was published in arXiv (see arXiv:0807.3694, Disjoint minimal graphs).

The author has removed this paper, following the publication of a more complete version.

This paper was withdrawn by the authors.

This paper has been withdrawn by the authors due to an incorrect analysis.

We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections…

The authors have withdrawn this paper.

This paper has been withdrawn by the authors.