E. Balas and R. Jeroslow, Canonical Cuts on the Unit Hypercube, SIAM Journal on Applied Mathematics, vol.23, issue.1, pp.61-69, 1972.
DOI : 10.1137/0123007

M. and R. Emamy-khansary, On the cuts and cut number of the 4-cube, Journal of Combinatorial Theory, Series A, vol.41, issue.2, pp.211-227, 1986.
DOI : 10.1016/0097-3165(86)90081-6

M. and R. Emamy-khansary, On the covering cuts of cd (d???5), Discrete Mathematics, vol.68, issue.2-3, pp.191-196, 1988.
DOI : 10.1016/0012-365X(88)90112-4

M. and R. Emamy-khansary, On the Cut-number of the 5-Cube, Congressus Numerantium, pp.179-186, 1990.

M. , R. Emamy-khansary, P. Pei, and C. Caiseda, Cut-complexes and the greedy paths in the ncube, in Proceedings of the 8th Quadrenial International Conference on Graph Theory, pp.151-160, 1999.

B. Grünbaum, Polytopal Graphs, MAA Stud. Math. Math. Assoc. Amer, vol.12, pp.201-204, 1975.

A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, and G. Turán, Threshold Circuits of Bounded Depth, Proc. 28th Ann. Symp. on Foundations of Computer Science, pp.99-110, 1987.

P. L. Hammer, B. Simone, T. M. Liebling, and D. De-werras, From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions, SIAM J. Disc. Math. 1 No, pp.174-184, 1988.
DOI : 10.1137/0401019

V. Klee, Shapes of the Future ? Some Unresolved Problems in High-Dimensional Intuitive Geometry, Proceedings of the 11th CCCG, p.17, 1999.

P. O. Neil, Hyperplane cuts of an n-cube, Discrete Mathematics, vol.1, issue.2, pp.193-195, 1971.
DOI : 10.1016/0012-365X(71)90025-2

J. Nievergelt, All the needles in a haystack: Can exhaustive search overcome combinatorial chaos?, pp.254-274, 1995.
DOI : 10.1007/BFb0015248

E. Michael and . Saks, Slicing the hypercube, in Surveys in Combinatorics, pp.211-255, 1993.

C. Sohler and M. Ziegler, Computing Cut Numbers, in Proceedings of the 12th Annual Canadian Conference on Computational Geometry, pp.73-79, 2000.

M. Ziegler, Intermediate results for computing cut numbers