Skip to main content

Graph Theory, Konigsberg Problem

  • Reference work entry
  • 145 Accesses

Synonyms

Problem of seven bridges of Konigsberg; Euler's Konigsberg's bridges problem; Edge routing problems

Definition

In Geographic Information Systems, concepts from graph theory are extremely useful in expressing the spatial structure of entities seen as points, lines, areas and solids, after the geometrical details of these entities are removed. For example, in transportation and river networks, the topological properties of their structures can be represented using graphs. This article describes the origins of graph theory and the impact it has on various fields ranging from geography to economics.

The Konigsberg Bridge Problem is a classic problem, based on the topography of the city of Konigsberg, formerly in Germany but now known as Kalingrad and part of Russia. The river Pregel divides the city into two islands and two banks as shown in Fig 1. The city had seven bridges connecting the mainland and the islands (represented by thick lines in the figure). [1,2,3,4]. The problem...

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

Recommended Reading

  1. Chartrand, G.: The Königsberg Bridge Problem: An Introduction to Eulerian Graphs. In: Introductory Graph Theory. Dover, New York (1985)

    Google Scholar 

  2. Harary, F.: Graph Theory, pp. 1–2. Addison-Wesley, Reading (1994)

    Google Scholar 

  3. Biggs, N.L., Lloyd, E.K., Wilson, R.J.: Graph Theory 1736–1936. Oxford University Press, Oxford (1976)

    MATH  Google Scholar 

  4. Bollobás, B.: Graph Theory: An Introductory Course, p.~12. Springer, Berlin (1979)

    Google Scholar 

  5. Steinhaus, H.: Mathematical Snapshots, 3rd edn. Dover, New York (1999), pp. 256–259

    MATH  Google Scholar 

  6. Hartsfield, R.: Pearls in Graph Theory. Academic Press, San Diego (1990)

    MATH  Google Scholar 

  7. Fleischner, H.: (Some of) the many uses of Eulerian Graphs in graph theory, Discrete Math. 230, 23–43 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Biggs, N.L., Lloyd, E.K., Wilson, R.J.: Graph Theory. Oxford University Press, Oxford (1998)

    MATH  Google Scholar 

  9. Wilson, R.J.: Introduction to Graph Theory. Longman Inc., New York (1985)

    MATH  Google Scholar 

  10. Edmonds, J., Johnson, E.L.: Matching, Euler tours and Chinese Postman, Math. Program. 5, 88–124 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  11. Christofides, N.: The optimum traversal of a graph, Int. J. Manage. Sci. 1(6) (1973)

    Google Scholar 

  12. Evans, J.R., Minieka, E.: Optimization Algorithms for Networks and Graphs. Marcel Dekker Inc., New York (1992)

    Google Scholar 

  13. Shekhar, S., Chawla, S.: Spatial Databases: A Tour. Prentice Hall, New Jersey (2003)

    Google Scholar 

  14. Wilson, R.J., Beineke, L.W. (eds.): Applications of graph theory. Academic Press, London, New York (1979)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

George, B. (2008). Graph Theory, Konigsberg Problem. In: Shekhar, S., Xiong, H. (eds) Encyclopedia of GIS. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35973-1_547

Download citation

Publish with us

Policies and ethics