Publisher
Springer International Publishing
Reference17 articles.
1. Amilhastre, J., Vilarem, M., Janssen, P.: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs. Discrete Appl. Math. 86(2), 125–144 (1998)
2. Berge, C.: Hypergraphs - Combinatorics of Finite Sets, vol. 45. North-Holland Mathematical Library, North-Holland (1989)
3. de Caen, D., Gregory, D., Pullman, N.J.: The Boolean rank of zero-one matrices. In: Proceedings of 3rd Caribbean Conference on Combinatorics and Computing, pp. 169–173 (1981)
4. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)
5. Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Can. J. Math. 32(3), 734–765 (1980)