Chromatic characterization of biclique covers

Discrete Mathematics

Volumn 306, Issue 5, 2006, Pages 495-507

  Cornaz, Denis ^a   Fonlupt, Jean ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Biclique; Bipartite; Chromatic number ; Clique number

Indexed keywords

CHROMATES; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIALS; SET THEORY;

BICLIQUE; BIPARTITE; CHROMATIC NUMBER Χ; CLIQUE NUMBER Ω;

GRAPH THEORY;

EID: 33644914697     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.01.010     Document Type: Article

References (17)

1. G. Alexe, S. Alexe, S. Foldes, P.L. Hammer, B. Simeone, Consensus algorithms for the generation of all maximal bicliques, DIMACS Technical Report 2000-14, May 2000.
2. J. Amilhastre, P. Janssen, and M.-C. Vilarem Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs Discrete Appl. Math. 86 1998 125 144
3. J.-C. Bermond, Couverture des arêtes d'un graphes par des graphes bipartis complets, University of Paris-Sud, Centre d'Orsay, Rapport de Recherche No. 10., 1978, preprint.
4. F.R.K. Chung On the coverings of graphs Discrete Math. 30 1980 89 93
5. D. Cornaz, Problèmes de sous-graphes p-partis complets et télécommunication, Thèse de doctorat de l'université Pierre et Marie Curie, 2003.
6. P.C. Fishburn, and P.L. Hammer Bipartite dimensions and bipartite degrees of graphs Discrete Math. 160 1996 127 148
7. A. Frank Connectivity and network flows R. Graham M. Grötschel L. Lovász Handbook of Combinatorics 1995 Elsevier Science Amsterdam 111 177
8. M. Grötschel, L. Lovàsz, and A. Schrijver The ellipsoid method and its consequences in combinatorial optimization Combinatorica 1 2 1981 169 197
9. O. Günlük, A New Min-cut Max-flow Ratio for Multicommodity Flows 2001, in preparation.
10. F. Harary, D. Hsu, and Z. Miller The biparticity of a graph J. Graph Theory 1 1977 131 133
11. K.F. Jones, J.R. Lundgren, N.J. Pullman, and R. Rees A note on the covering numbers of K n K m and complete t -partite graphs Congr. Numer. 66 1988 181 184
12. S.D. Monson, N.J. Pullman, and R. Rees A survey of clique and biclique coverings and factorizations of (0, 1 ) -matrices Bull Inst. Contrum. Appl. ICA 14 1995 17 86
13. H. Müller On edge perfectness and classes of bipartite graphs Discrete Math. 149 1996 159 187
14. J. Orlin Contentment in graph theory Indag. Math. 39 1977 758 762
15. R. Peeters The maximum edge biclique problem in NP-complete Discrete Appl. Math. 131 2003 651 654
16. H.U. Simon On approximable solution for combinatorial optimization problems SIAM J. Discrete Math. 3 2 1990 294 310
17. Zs. Tuza Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices Combinatorica 4 1 1984 111 116