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.

• Type: Conference
• Year: 2005
• Where: SOFSEM
• Authors: Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto
• Keywords: Complete P−partite Graphs, Equal Size Partite, SOFSEM 2005, Straight Line Segment, Theoretical Computer Science