Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/2385

Title: Outerplanar crossing numbers of 3-row meshes, Halin graphs and complete p-partite graphs
Authors: Fulek, R.
He, H.
Sykora, Ondrej
Vrt'o, Imrich
Issue Date: 2005
Publisher: © Springer Verlag
Citation: FULEK et al, 2005. Outerplanar crossing numbers of 3-row meshes, Halin graphs and complete p-partite graphs. IN: Vojtáš et al (eds.), Proceedings of the 31st Annual Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005. Lecture notes in computer science, 3381, Berlin : Springer Verlag, pp. 376-379
Abstract: 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.
Description: This is a conference paper. The definitive version is available from: http://springerlink.metapress.com/content/105633/?sortorder=asc&p_o=719
URI: https://dspace.lboro.ac.uk/2134/2385
ISBN: 9783540243021
ISSN: 0302-9743
Appears in Collections:Conference Papers (Computer Science)

Files associated with this item:

File Description SizeFormat
FHSV05.pdf130.8 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.