A Notion of Cross-Perfect Bipartite Graphs

Authors:
Milind Dawande
Affiliations:
-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 4
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
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.00

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.