1. Alon,N. and Boppana,R.: The monotone complexity of Boolean functions, Techn. Rep., 1985.
2. Bloniarz,P.: The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph, Ph.D. Thesis, MIT, 1979.
3. Bublitz, S.: Decomposition of graphs and monotone formula size of homogeneous functions, Acta Informatica 23, 689–696, 1986.
4. Chung, F.R.K.: On the covering of graphs, Discrete Mathematics 3O, 89–93, 1980.
5. Erdös, E. and Szekeres, G.: A combinatorial problem in geometry, Compositio Math. 2, 463–470, 1935.