Revision history of "A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph" (Q1628689)
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.
