Skip to main content
SpringerLink
Log in

Monotone Drawings of Planar Graphs

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Included in the following conference series:

Abstract

Let G be a graph drawn in the plane so that its edges are represen tedbk;-monotone curv es, any p air of w hich cross anenvumber of times. We show that G can be redrawn in such a w ay Hat the cordinates of the vertices remain une hanged and the edges become non-crossing straigh t-linesegments.

Work on this pap er by Jáhos P ach hasbeensupported by NSFgran t CCR-00-98246, by PSC-CUNYResearch A word 63382-0032. Work by Geźa Tótüiasbeen supported by Hungarian Science F oundationgran t OTKAT-038397.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ch. Chojnacki, A. Hanani, Über wesentlich unplättbare Kurven im dreidimensionalen Raume, Fund. Math. 23 (1934), 135–142.

    MATH  Google Scholar 

  2. G. Cairns and Y. Nikolayevsky, Bounds for generalized thrackles, Discrete Comput. Geom. 23 (2000), 191–206.

    Article  MATH  MathSciNet  Google Scholar 

  3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing, Prentice Hall, Upper Saddle River, NJ, 1999.

    Book  MATH  Google Scholar 

  4. G. Ehrlich, S. Even, and R. E. Tarjan, Intersection graphs of curves in the plane, Journal of Combinatorial Theory, Series B 21 (1976), 8–20.

    Article  MATH  MathSciNet  Google Scholar 

  5. I. Fáry, On straight line representation of planar graphs, Acta Univ. Szeged. Sect. Sei. Math. 11 (1948), 229–233.

    Google Scholar 

  6. W. T. Tutte, Toward a theory of crossing numbers, J. Combinatorial Theory 8 (1970), 45–53.

    Article  MATH  MathSciNet  Google Scholar 

  7. K. Wagner, Bemerkungen zum Vierfarbenproblem, Jber. Deutsch, math. Vereinigung 46 (1936), 26–32.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. City College, CUNY and Courant Institute of Mathematical Sciences, New YorkUniversity, New York, NY, 10012, USA

    János Pach

  2. R énylnstitute of the Hungarian Academy of Sciences, H-1364, Budapest, P.O.B.127, Hungary

    Gézá Tóth

Authors
  1. János Pach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gézá Tóth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pach, J., Tóth, G. (2002). Monotone Drawings of Planar Graphs. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation