Revision history of "Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph" (Q458589)
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.
