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 foll...

Full description

Bibliographic Details

Main Authors:	R. Fulek, Hongmei He, Ondrej Sykora, Imrich Vrt'o
Format:	Default Text
Published:	2005
Subjects:	Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/2385
Tags:	Add Tag No Tags, Be the first to tag this record!