1. A linear programming formulation for the maximum complete multipartite subgraph problem
2. Chromatic characterization of biclique covers
3. D. Cornaz and A.R. Mahjoub, The maximum induced bipartite subgraph problem with edge weights.SIAM J. on Discrete Math.to appear.
4. D. Cornaz,On forests, stable sets and polyhedra associated with clique partitions.Manuscript available on Optimization Online.
5. V. Jost,Ordonnancement chromatique : polyèdres, complexité et classification.Thèse de l'Université Joseph Fourier, Grenoble (2006).