On covering graphs by complete bipartite subgraphs (Q1025967): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.09.036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152486369 / rank | |||
Normal rank | |||
Revision as of 02:52, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On covering graphs by complete bipartite subgraphs |
scientific article |
Statements
On covering graphs by complete bipartite subgraphs (English)
0 references
23 June 2009
0 references
edge clique covering number
0 references
biclique
0 references
fractional covers
0 references
Boolean functions
0 references
communication complexity
0 references
