Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices

DOI10.1016/0095-8956(91)90006-6MaRDI QIDQ810058zbMATH OpenOpenAlexFDO

Authors D. A. Gregory, Norman J. Pullman, Kathryn Fraughnaugh Jones, J. Richard Lundgren

Publication date 1991

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(91)90006-6

zbMATH Keywords

biclique coveringsbigraphcomplete bipartite subgraphsedge partitionminimum number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Publication:4207933
• Minimum matrix rank of k-regular (0,1) matrices
• scientific article; zbMATH DE number 4053683
• scientific article; zbMATH DE number 1439493
• scientific article; zbMATH DE number 4045794

Cites work

• Applications of edge coverings by cliques
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• scientific article; zbMATH DE number 3838071 (Why is no real title available?)
• scientific article; zbMATH DE number 4008576 (Why is no real title available?)
• scientific article; zbMATH DE number 4031723 (Why is no real title available?)
• scientific article; zbMATH DE number 4108799 (Why is no real title available?)
• scientific article; zbMATH DE number 3735865 (Why is no real title available?)
• scientific article; zbMATH DE number 3760209 (Why is no real title available?)
• scientific article; zbMATH DE number 3781471 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• On the addressing problem for directed graphs
• On the Addressing Problem for Loop Switching
• On the minimum rank of regular classes of matrices of zeros and ones

Cited in

(26)

• Singular (0,1) matrices with constant row and column sums
• Factorizations of matrices over semirings.
• The augmentation property of binary matrices for the binary and Boolean rank
• Parameterized low-rank binary matrix approximation
• The Boolean rank of the uniform intersection matrix and a family of its submatrices
• The complexity of tropical matrix factorization
• On the binary and Boolean rank of regular matrices
• scientific article; zbMATH DE number 436068 (Why is no real title available?)
• On maximal isolation sets in the uniform intersection matrix
• Isolation numbers of integer matrices and their preservers
• Further results on the minimum rank of regular classes of (0,1)-matrices
• scientific article; zbMATH DE number 4053683 (Why is no real title available?)
• Boolean rank of upset tournament matrices
• Isolation number versus Boolean rank
• scientific article; zbMATH DE number 4128849 (Why is no real title available?)
• The nonnegative rank of a matrix: hard problems, easy solutions
• scientific article; zbMATH DE number 2170465 (Why is no real title available?)
• scientific article; zbMATH DE number 1439493 (Why is no real title available?)
• Parameterized low-rank binary matrix approximation
• Oriented spanning trees and stationary distribution of digraphs
• A study of the binary and Boolean rank of matrices with small constant real rank
• A Yannakakis-type theorem for lifts of affine semigroups
• A study of the binary and Boolean rank of matrices with small constant real rank
• Property testing of the Boolean and binary rank
• Minimum matrix rank of k-regular (0,1) matrices
• A set coverage problem

This page was built for publication: Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810058)