Revision history of "The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases" (Q3507648)
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.
