In this paper, we consider the problem of determining precisely which graphic matroids \(M\) have the property that the splitting operation,by every pair of elements, on \(M\) yields a cographic matroid. This problem is solved by proving that there are exactly three minorminimal graphs that do not have this property.