An Eulerian trail for the graph above will be possible if only one edge is removed.
In how many different ways could this be done?
- `2`
- `3`
- `4`
- `5`
Show Worked Solution
`text{Konigsberg: an Eulerian trail needs two vertices (only) to have}`
`text{an odd degree.}`
`text{The graph has 4 vertices that are odd degree.}`
`text{Removing any of the dashed edges below would achieve this.}`
`=> D`