Determine a decomposition of the Grötzsch graph into 3 paths. Enumerate these paths by their vertices.
I see why there must be 3 about the center vertex (w by convention in the Mycielskian), but what is the specific enumeration here. The other stack exchange question on this topic provides an enumeration with 19 edges, which cannot be correct. How should i find this decomposition?
There are six vertices of odd degree: one of degree 5 and five of degree 3. Pick four of the degree 3 vertices and connect them in pairs by two edge pasths across the degree 5 vertex. Then find an Euler path for the rest by starting at one of the two remaining odd vertices and ending at the other