Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 2005: SOFSEM 2005: Theory and Practice of Computer Science pp 376–379Cite as

Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3381))

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.

This research was supported by the EPSRC grant GR/S76694/01 and by VEGA grant No. 2/3164/23.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kainen, P.C.: The book thickness of a graph II. Congressus Numerantium 71, 121–132 (1990)

    MathSciNet  Google Scholar 

  2. Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the NP-completeness of a computer network layout problem. In: Proc. IEEE Intl. Symposium on Circuits and Systems 1987, pp. 292–295. IEEE Computer Society Press, Los Alamitos (1987)

    Google Scholar 

  3. Riskin, A.: On the outerplanar crossing numbers of K m,n . Bulletin ICA 39, 7–15 (2003)

    MathSciNet  Google Scholar 

  4. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrťo, I.: Crossing numbers: bounds and applications. In: Bárány, I., Böröczky, K. (eds.) Intuitive Geometry, Bolyai Society Mathematical Studies 6, pp. 179–206. Akadémia Kiadó, Budapest (1997)

    Google Scholar 

  5. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrťo, I.: The book crossing number of graphs. J. Graph Theory 21, 413–424 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynská dolina, 842 48, Bratislava, Slovak Republic

    Radoslav Fulek

  2. Department of Computer Science, Loughborough University, Loughborough, Leicestershire, LE11 3TU, United Kingdom

    Hongmei He & Ondrej Sýkora

  3. Department of Informatics, Institute of Mathematics, Slovak Academy of Sciences, Dúbravská 9, 841 04, Bratislava, Slovak Republic

    Imrich Vrťo

Authors
  1. Radoslav Fulek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongmei He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ondrej Sýkora
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Imrich Vrťo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Charles University, Prague, Czech Republic

    Peter Vojtáš

  2. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava,  

    Mária Bieliková

  3. STIX, École Polytechnique, 91128, Palaiseau Cedex, France

    Bernadette Charron-Bost

  4. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fulek, R., He, H., Sýkora, O., Vrťo, I. (2005). Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30577-4_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24302-1

  • Online ISBN: 978-3-540-30577-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation