What is the problem of the seven bridges of Konisberg and what is Euler's theorem about it?
a) The problem of the seven bridges of Konisberg is to find a way to cross the city passing only once through each bridge and returning to the starting point. Euler's theorem states that there is an Eulerian circuit in a graph if and only if the graph is connected and each vertex has an even degree.
b) The problem of the seven bridges of Konisberg is to find a way to cross the city passing only once through each bridge and returning to the starting point. Euler's theorem states that there is an Eulerian circuit in a graph if and only if the graph is connected and each vertex has an odd degree.
c) The problem of the seven bridges of Konisberg is to find a way to cross the city passing twice through each bridge and returning to the starting point. Euler's theorem states that there is an Eulerian circuit in a graph if and only if the graph is connected and each vertex has an even degree.