Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices

Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

On covering graphs by complete bipartite subgraphs
Bipartite Coverings of Graphs
Covering a graph by complete bipartite graphs
scientific article; zbMATH DE number 3841905
The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs

Cites work

scientific article; zbMATH DE number 3140515 (Why is no real title available?)
scientific article; zbMATH DE number 3238444 (Why is no real title available?)
scientific article; zbMATH DE number 3019031 (Why is no real title available?)
Covers in hypergraphs
Distance matrix polynomials of trees
Graph Theory and Probability
On a problem of G. O. H. Katona and T. Tarján
On complete subgraphs of different orders
On the coverings of graphs
On the decomposition ofkn into complete bipartite graphs
The Representation of a Graph by Set Intersections
The biparticity of a graph
Triangle-free partial graphs and edge covering theorems

Cited in

(39)

Complexity of products of some complete and complete bipartite graphs
On set intersection representations of graphs
An overview of graph covering and partitioning
New lower bounds for Hopcroft's problem
On counting point-hyperplane incidences
Chromatic characterization of biclique covers
Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
Biclique-Helly graphs
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
Hypergraph coverings and local colorings
On covering graphs by complete bipartite subgraphs
The lexicographic method for the threshold cover problem
Generating bicliques of a graph in lexicographic order
Consensus algorithms for the generation of all maximal bicliques
On the information rate of secret sharing schemes
The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
On the generation of bicliques of a graph
Biclique graphs and biclique matrices
Biclique covers and partitions
Representation complexities of semialgebraic graphs
Can visibility graphs be represented compactly?
Coloring temporal graphs
Covering a graph by complete bipartite graphs
A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
Finding bipartite subgraphs efficiently
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
Edge clique covering sum of graphs
On the context-free production complexity of finite languages
New upper bound for sums of dilates
Semi-algebraic off-line range searching and biclique partitions in the plane
Turán and Ramsey properties of subcube intersection graphs
Coverings of r—graphs by complete r—partite subgraphs
On optimal exact coverings of a graph in the class of weakly dense bases
The conjunctive complexity of quadratic Boolean functions
scientific article; zbMATH DE number 790476 (Why is no real title available?)
scientific article; zbMATH DE number 6179141 (Why is no real title available?)
Structural properties of biclique graphs and the distance formula
On the computational complexity of partial covers of theta graphs
Modeling combinatorial disjunctive constraints via junction trees

This page was built for publication: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices

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