Edge-cuts leaving components of order at least three

On an extremal problem in graph theory

Péter L. Erdős · Colloquium Mathematicum · 1964 · 676 citations · Full text

Natural Sciences, Mathematics, Combinatorics +6

Generalized measures of fault tolerance with application to N-cube networks

Abdol‐Hossein Esfahanian · IEEE Transactions on Computers · 1989 · 394 citations

Computing, Computer Engineering, Computer Science +17

On computing a conditional edge-connectivity of a graph

Abdol‐Hossein Esfahanian, S. L. Hakimi · Information Processing Letters · 1988 · 351 citations

Computing, Computer Science, Algorithms +10

An extremal problem in graph theory

P. Erdös, Leo Moser · Journal of the Australian Mathematical Society · 1970 · 263 citations · Full text

Natural Sciences, Mathematics, Algorithms +4

On restricted edge-connectivity of graphs

Jun‐Ming Xu, Ke-li Xu · Discrete Mathematics · 2002 · 90 citations

Natural Sciences, Computer Science, Mathematics +8