On the CNF-complexity of bipartite graphs containing no squares (Q1936267): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:40, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the CNF-complexity of bipartite graphs containing no squares |
scientific article |
Statements
On the CNF-complexity of bipartite graphs containing no squares (English)
0 references
21 February 2013
0 references
squares
0 references
graph complexity
0 references
probabilistic construction
0 references
