Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
From MaRDI portal
Publication:802577
DOI10.1007/BF02579163zbMath0559.05050MaRDI QIDQ802577
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
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)
Related Items
On counting point-hyperplane incidences, Chromatic characterization of biclique covers, Can visibility graphs be represented compactly?, An overview of graph covering and partitioning, Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,, On the context-free production complexity of finite languages, Covering a graph by complete bipartite graphs, New upper bound for sums of dilates, Hypergraph coverings and local colorings, Biclique covers and partitions, Modeling combinatorial disjunctive constraints via junction trees, Edge clique covering sum of graphs, Unnamed Item, On the information rate of secret sharing schemes, Turán and Ramsey Properties of Subcube Intersection Graphs, Coloring temporal graphs, Biclique-Helly graphs, Consensus algorithms for the generation of all maximal bicliques, Generating bicliques of a graph in lexicographic order, Biclique graphs and biclique matrices, Finding bipartite subgraphs efficiently, Coverings of r—graphs by complete r—partite subgraphs, On set intersection representations of graphs, On the generation of bicliques of a graph, New lower bounds for Hopcroft's problem, On covering graphs by complete bipartite subgraphs, Representation Complexities of SemiAlgebraic Graphs, The conjunctive complexity of quadratic Boolean functions, Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the coverings of graphs
- Triangle-free partial graphs and edge covering theorems
- Distance matrix polynomials of trees
- Covers in hypergraphs
- Graph Theory and Probability
- On a problem of G. O. H. Katona and T. Tarján
- On the decomposition ofkn into complete bipartite graphs
- On complete subgraphs of different orders
- The biparticity of a graph
- The Representation of a Graph by Set Intersections