Skip to main content

Disjoint paths in the plane

  • Conference paper
  • First Online:
Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1018))

  • 1385 Accesses

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
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.

References

  1. A. Frank, Disjoint paths in a rectilinear grid, Combinatorica (submitted).

    Google Scholar 

  2. H. Okamura and P.D. Seymour, Multicommodity flows in planar graphs, Discrete Mathematics (to appear).

    Google Scholar 

  3. P.D. Seymour, Disjoint paths in graphs, Discrete Mathematics, 29 (1980), 293–309.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. Borowiecki John W. Kennedy Maciej M. Sysło

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Frank, A. (1983). Disjoint paths in the plane. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071609

Download citation

  • DOI: https://doi.org/10.1007/BFb0071609

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12687-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics