Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
暂无分享，去创建一个
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one straight-line segment. We derive exact results for the minimal number of crossings in any outerplanar drawings of the following classes of graphs: 3-row meshes, Halin graphs and complete p–partite graphs with equal size partite sets.
[1] Tamal K. Dey,et al. Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..
[2] F. Shahrokhi,et al. Crossing Numbers: Bounds and Applications , 1997 .
[3] Paul C. Kainen,et al. The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.
[4] Sudipto Guha,et al. Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas , 2002, SIAM J. Comput..
[5] Farhad Shahrokhi,et al. The book crossing number of a graph , 1996 .