konigsberg bridge problem

Königsberg bridge problem

a mathematical problem in graph theory, solved by Leonhard Euler, to show that it is impossible to cross all seven bridges of the Prussian city of Königsberg in a continuous path without recrossing any bridge.
Dictionary.com Unabridged
Based on the Random House Dictionary, © Random House, Inc. 2014.
Cite This Source Link To konigsberg bridge problem
Explore Dictionary.com
Previous Definition: konigsberg
Next Definition: konigshutte
More from Thesaurus.com
Synonyms and Antonyms for konigsberg bridge problem
More from Reference.com
Search for articles containing konigsberg bridge problem
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature