Revision history of "Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth" (Q2314068)
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.