A linear algorithm for bipartition of biconnected graphs

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

Fault-tolerant routings in a K-connected network

Makoto Imase, Yoshifumi Manabe · Information Processing Letters · 1988 · 20 citations

Computing, Computer Engineering, Computer Systems +14