AnO(k 2n2) algorithm to find ak-partition in ak-connected graph

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Hiroshi Nagamochi, Toshihide Ibaraki · Algorithmica · 1992 · 365 citations

Computing, Computer Science, Topology +4

On the complexity of partitioning graphs into connected subgraphs

Martin Dyer, Alan Frieze · Discrete Applied Mathematics · 1985 · 167 citations

Computing, Computer Science, Algorithms +6

A homology theory for spanning tress of a graph

László Lovász · Acta Mathematica Academiae Scientiarum Hungaricae · 1977 · 120 citations

Natural Sciences, Computer Science, Mathematics +11