Covering a graph by complete bipartite graphs
From MaRDI portal
Recommendations
Cites work
- Circuit coverings of graphs and a conjecture of Pyber
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- scientific article; zbMATH DE number 426361 (Why is no real title available?)
- scientific article; zbMATH DE number 3841905 (Why is no real title available?)
- On the Addressing Problem for Loop Switching
- On the information rate of secret sharing schemes
Cited in
(39)- On covering graphs by complete bipartite subgraphs
- Edge clique covering sum of graphs
- Biclique cover and local clique cover of graphs
- Some new bounds for cover-free families through biclique covers
- Determination of the star valency of a graph
- Growing balanced covering sets
- On difference graphs and the local dimension of posets
- Exact information ratios for secret sharing on small graphs with girth at least 5
- An overview of graph covering and partitioning
- Secret sharing on the \(d\)-dimensional cube
- On biclique coverings
- Counting vertices and cubes in median graphs of circular split systems
- Secret sharing on large girth graphs
- Local boxicity and maximum degree
- Secret sharing schemes for dense forbidden graphs
- Secret-sharing schemes for very dense graphs
- scientific article; zbMATH DE number 3841905 (Why is no real title available?)
- scientific article; zbMATH DE number 5080500 (Why is no real title available?)
- Local clique covering of claw-free graphs
- On set intersection representations of graphs
- scientific article; zbMATH DE number 4087706 (Why is no real title available?)
- scientific article; zbMATH DE number 68563 (Why is no real title available?)
- scientific article; zbMATH DE number 175738 (Why is no real title available?)
- Biclique covers and partitions
- Bipartite Coverings of Graphs
- scientific article; zbMATH DE number 1501958 (Why is no real title available?)
- Erdős-Pyber theorem for hypergraphs and secret sharing
- On covering numbers, Young diagrams, and the local dimension of posets
- Decomposition of random graphs into complete bipartite graphs
- Secret sharing schemes for ports of matroids of rank 3.
- Succinct computational secret sharing
- On-line secret sharing
- Secret-sharing schemes for high slices
- New upper bounds for evolving secret sharing via infinite branching programs
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- Cryptography with weak privacy
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- On the biclique cover of the complete graph
- On the decomposition of graphs into complete bipartite graphs
This page was built for publication: Covering a graph by complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363672)
