Revision history of "Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable" (Q489724)
From MaRDI portal
Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
