Pages that link to "Item:Q1025967"
From MaRDI portal
The following pages link to On covering graphs by complete bipartite subgraphs (Q1025967):
Displaying 22 items.
- Biclique covers and partitions (Q405095) (← links)
- Mod/Resc parsimony inference: theory and application (Q418168) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- Covering a graph by complete bipartite graphs (Q1363672) (← links)
- Biclique cover and local clique cover of graphs (Q1734028) (← links)
- Regarding two conjectures on clique and biclique partitions (Q2121747) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- Ordered biclique partitions and communication complexity problems (Q2342387) (← links)
- Fooling-sets and rank (Q2346587) (← links)
- Some improved bounds on communication complexity via new decomposition of cliques (Q2636816) (← links)
- On set intersection representations of graphs (Q3633007) (← links)
- (Q3739169) (← links)
- (Q4034791) (← links)
- (Q4320657) (← links)
- Bipartite Coverings of Graphs (Q4354593) (← links)
- Fractional coverings, greedy coverings, and rectifier networks (Q4636621) (← links)
- (Q4691844) (← links)
- (Q4691855) (← links)
- Turán and Ramsey Properties of Subcube Intersection Graphs (Q4903262) (← links)
- \(P_4\)-free partition and cover numbers \& applications (Q6107268) (← links)