Combinatorial Aspects in Graph Drawing
Maryam Tahmasbi · 2009
Given a graph G, a drawing of G is a function that maps each vertex v to a distinct point ( v) in the plane and each edge uv to a simple open Jordan curve ( uv) with endpoints u and v. Graph drawing, in general, deals with automatic generation of drawings for a given graph. There are dierent standards for drawing a graph. In this paper we emphasis on combinatorial aspects of graph drawing. We present necessary and sucient combinatorial condition for an embedded graph with given shape to have orthogonal drawing, and for a digraph to have upward drawing in the plane. Then we extend the results to higher dimensions and some surfaces.