Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
From MaRDI portal
Publication:802577
DOI10.1007/BF02579163zbMATH Open0559.05050MaRDI QIDQ802577FDOQ802577
Authors: Zsolt Tuza 
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
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)
Cites Work
- Graph Theory and Probability
- Distance matrix polynomials of trees
- On a problem of G. O. H. Katona and T. Tarján
- Title not available (Why is that?)
- The biparticity of a graph
- On the decomposition ofkn into complete bipartite graphs
- On the coverings of graphs
- Title not available (Why is that?)
- On complete subgraphs of different orders
- The Representation of a Graph by Set Intersections
- Triangle-free partial graphs and edge covering theorems
- Title not available (Why is that?)
- Covers in hypergraphs
Cited In (37)
- On set intersection representations of graphs
- Complexity of products of some complete and complete bipartite 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
- Biclique-Helly graphs
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
- Hypergraph coverings and local colorings
- The lexicographic method for the threshold cover problem
- On covering graphs by complete bipartite subgraphs
- Generating bicliques of a graph in lexicographic order
- Consensus algorithms for the generation of all maximal bicliques
- 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
- On the information rate of secret sharing schemes
- Biclique graphs and biclique matrices
- Representation complexities of semialgebraic graphs
- Biclique covers and partitions
- 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
- New upper bound for sums of dilates
- On the context-free production complexity of finite languages
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structural properties of biclique graphs and the distance formula
- Modeling combinatorial disjunctive constraints via junction trees
- On the computational complexity of partial covers of theta graphs
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)
