Revision history of "On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case" (Q922525)
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.