What is a Graph? · Graphs

Lesson 8

Nikolai Chukhin · Alexander S. Kulikov

Problem. In the 18th century, Königsberg consisted of four parts connected by seven bridges.

Can you find a walk through Königsberg that visits each bridge exactly once? Try it!

5 points

  1. There exists such a walk.

  2. There is no such walk.