Given a minimum biclique edge cover, is it always possible to assign each biclique to a distinct left node (which it contains)?ie one such assignment for this graph (from wikipedia): http://upload.wikimedia.org/wikipedia/commons/f/f7/Bipartite-dimension-biclique-cover.svg could be(numbering the left vertices from 1 through 5 going down)blue: 1red: 2green: 3black: 4
Assign each biclique to a distinct left
graph theory