How robust is the n-cube?

The cube-connected cycles: a versatile network for parallel computation

Franco P. Preparata, Jean Vuillemin · Communications of the ACM · 1981 · 983 citations · Full text

Cluster Computing, Engineering, Computer Architecture +17

A Decomposition Theorem for Partially Ordered Sets

R. P. Dilworth · Annals of Mathematics · 1950 · 976 citations

Order Theory, Partially Ordered Sets, Extremal Set Theory +3

Every planar map is four colorable. Part I: Discharging

K. I. Appel, Wolfgang Haken · Illinois Journal of Mathematics · 1977 · 870 citations

Cartography, Color Reproduction, Colorization +2

The Indirect Binary n-Cube Microprocessor Array

Pease · IEEE Transactions on Computers · 1977 · 500 citations

Computational Facility, Massively-parallel Computing, Array Computing +13

Families of k-independent sets

Daniel J. Kleitman, Joel Spencer · Discrete Mathematics · 1973 · 235 citations

K-independent Sets, Combinatorial Design, Extremal Set Theory +2