Revision history of "Deciding whether a planar graph has a cubic subgraph is NP-complete" (Q1318823)
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.
