Affordable Access

Publisher Website

On edge perfectness and classes of bipartite graphs

Authors
Journal
Discrete Mathematics
0012-365X
Publisher
Elsevier
Publication Date
Volume
149
Identifiers
DOI: 10.1016/0012-365x(94)00350-r
Disciplines
  • Computer Science

Abstract

Abstract 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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Edge-Coloring Bipartite Graphs

on Journal of Algorithms Jan 01, 2000

Classes of bipartite graphs related to chordal gra...

on Discrete Applied Mathematics Jan 01, 1991
More articles like this..