Tracing Eulerian Circuits in Graphs
Consider a connected graph representing a simplified urban transit network where intersections are vertices and roads are edges. (a) Sketch a possible graph that includes at least 6 vertices and contains exactly two vertices of odd degree. (b) Determine whether this graph has an Eulerian path, providing justification based on Eulerian criteria.