Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
type: Item
instance of: scholarly article
title: Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
zbMATH Open document ID: 0733.05064
DOI: 10.1016/0095-8956(91)90006-6
author: D. A. Gregory
author: Norman J. Pullman
author: Kathryn Fraughnaugh Jones
author: J. Richard Lundgren
published in: Journal of Combinatorial Theory. Series B
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 4212102
zbMATH Keywords: edge partition
zbMATH Keywords: biclique coverings
zbMATH Keywords: minimum number
zbMATH Keywords: complete bipartite subgraphs
zbMATH Keywords: bigraph
MaRDI profile type: Publication
full work available at URL: 0095-8956(91)90006-6
OpenAlex ID: W2165980303
cites work: Q3772244
cites work: On the minimum rank of regular classes of matrices of zeros and ones
cites work: On the addressing problem for directed graphs
cites work: Q3961028
cites work: On the Addressing Problem for Loop Switching
cites work: Q3758977
cites work: Q3832598
cites work: Q4152571
cites work: Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
cites work: Q3309876
cites work: Q3942989
cites work: Q3922718
cites work: Applications of edge coverings by cliques
cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
description: scientific article; zbMATH DE number 4212102