Problem #WSP-000146

Problems Graph theory

Problem

The city of Konigsberg has seven bridges as depicted on the layout below. \includegraphics[scale=0.5]https://problemsstatic.s3.amazonaws.com/production/taskimages/2829/WSP000146.png Is it possible for the great mathematician Leonard Euler to have an excursion in Konigsberg visiting all islands and land banks, but crossing each bridge exactly once?