On edge perfectness and classes of bipartite graphs Original Research Article

We define a notion of dependence for the edges of a graph and derive a concept of edge perfectness. We give some examples of classes of bipartite edge-perfect graphs. Moreover the complexity of the corresponding algorithms is investigated.