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.
Author supplied keywords
Cite
CITATION STYLE
Dawande, M. (2001). A notion of cross-perfect bipartite graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2108, pp. 409–413). Springer Verlag. https://doi.org/10.1007/3-540-44679-6_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
