On some lower bounds on the number of bicliques needed to cover a bipartite graph (Q6206447)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On some lower bounds on the number of bicliques needed to cover a bipartite graph |
scientific article; zbMATH DE number 900099017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some lower bounds on the number of bicliques needed to cover a bipartite graph |
scientific article; zbMATH DE number 900099017 |
Statements
8 August 2007
0 references
math.CO
0 references
