Revision history of "On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs" (Q4256092)
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.
