The following pages link to On biclique coverings (Q2468013):
Displaying 19 items.
- Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
- On biclique partitions of the complete graph (Q686164) (← links)
- On the biclique cover of the complete graph (Q897237) (← links)
- A set coverage problem (Q990137) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- Biclique cover and local clique cover of graphs (Q1734028) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- On the number of irreducible coverings by edges of complete bipartite graphs (Q1916141) (← links)
- Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric (Q1956321) (← links)
- Coherent network partitions (Q2026346) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- The biclique covering number of grids (Q2335697) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- On strong biclique covering. (Q2846625) (← links)
- (Q4242950) (← links)
- Biclique Coverings, Rectifier Networks and the Cost of ε-Removal (Q5496187) (← links)
- Odd covers of graphs (Q6094037) (← links)