On 2-visibility drawings of non-planar graphs (original) (raw)

On 2-visibility drawings of non-planar graphs

Bulletin Ica, 1999

Abstract

This short note shows that 2-visibility drawing of complete graphs K_n is only possible for n<9. The 2-visibility drawing of a graph is such that vertices are all rectangles and squares and edges are all horizontal and vertical segments. The solution of this problem has an application in VLSI-design.

Ibrahim Cahit hasn't uploaded this paper.

Create a free Academia account to let Ibrahim know you want this paper to be uploaded.

Ask for this paper to be uploaded.