Drawing Bipartite Graphs on Two Curves

Let G be a bipartite graph, and let λe, λi be two parallel convex curves; we study the question about whether G admits a planar straight line drawing such that the vertices of one partite set of G lie on λe and the vertices of the other partite set lie on λi. A characterization is presented that gives rise to linear time testing and drawing algorithms.

[1]  Walter Didimo,et al.  Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size , 1999, GD.

[2]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

[3]  Brendan D. McKay,et al.  On an edge crossing problem , 1986 .

[4]  Emilio Di Giacomo,et al.  Curve-constrained drawings of planar graphs , 2005, Comput. Geom..

[5]  Peter Eades,et al.  Drawing Graphs in Two Layers , 1994, Theor. Comput. Sci..