A notion of cross-perfect bipartite graphs

Authors:
Milind Dawande
Affiliations:
The University of Texas at Dallas, Richardson, TX
Venue:
Information Processing Letters
Year:
2003

Citing 7
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Optimizing combinatorial library construction via split synthesis

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Approximating clique and biclique problems

Journal of Algorithms
Bicliques and eigenvalues

Journal of Combinatorial Theory Series B
On bipartite and multipartite clique problems

Journal of Algorithms
The maximum edge biclique problem is NP-complete

Discrete Applied Mathematics
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this note, we consider four quantities defined on a bipartite graph B: the cross-chromatic index χ*(B), the biclique number w*(B), the cross-free matching number m*(B) and the biclique edge covering number β*(B). We mention several applications of these numbers and define a notion of cross-perfect bipartite graphs. A duality between these numbers for the class of cross-perfect graphs is examined.