Graph Theoryhard
0:00.0
A connected road network has intersections (vertices). Exactly of the intersections have an odd number of roads meeting them (odd degree). Which statement about Eulerian paths in this network is correct?
A connected road network has intersections (vertices). Exactly of the intersections have an odd number of roads meeting them (odd degree). Which statement about Eulerian paths in this network is correct?