Revision history of "The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices" (Q892049)
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.