Discrete MathematicsVolume 149, Issues 1–3, 22 February 1996, Pages 159-187On edge perfectness and classes of bipartite graphsAuthor links open overlay panelHaiko MüllerShow moreShareCitehttps://doi.org/10.1016/0012-365X(94)00350-RGet rights and contentUnder an Elsevier user licenseopen archiveAbstractWe 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.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1996 Published by Elsevier B.V.
