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.


Read Also:

  • Konigshutte

    [kœ-nikhs-hy-tuh] /ˈkœ nɪxsˌhü tə/ noun 1. German name of . /ˈkøːnɪçshytə/ noun 1. the German name for Chorzów

  • Konimeter

    [koh-nim-i-ter] /koʊˈnɪm ɪ tər/ noun 1. an instrument for measuring the amount of dust in the air. /kəʊˈnɪmɪtə/ noun 1. a device for measuring airborne dust concentration in which samples are obtained by sucking the air through a hole and allowing it to pass over a glass plate coated with grease on which the particles […]

  • Konini

    /ˈkɒniːniː/ noun (pl) konini 1. the edible dark purple berry of the kotukutuku (tree fuchsia)

  • Koniology

    /ˌkəʊnɪˈɒlədʒɪ/ noun 1. the study of atmospheric dust and its effects noun the scientific study of dust in the atmosphere and its effects on plant and animal life; also written coniology See coniology Word Origin Greek konis ‘dust’

Disclaimer: Konigsberg-bridge-problem definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.