Revision history of "Every planar graph without adjacent cycles of length at most 8 is 3-choosable" (Q2323250)
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.
