Revision history of "Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem" (Q1185245)
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.