Content
[Maximum mark: 8]
In Boston, times in minutes to get between various historical sites are given by the graph above.
- [2]
State with proof whether the graph contains any Eulerian circuits.
To earn a crown, get your answer ready before you reveal the options!
- [2]
Determine with proof whether the graph contains an Eulerian path.
A tour of Boston would like to take all roads between historical sites.
- [4]
Find the minimum time in which they can accomplish this.
Ask Plex AI about this problem
Get hints, ask questions, and work through this problem step by step
I'm Plex, here to help with problems on this worksheet!