On the complexity of bicoloring clique hypergraphs of graphs (Q4806592)
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 the complexity of bicoloring clique hypergraphs of graphs |
scientific article; zbMATH DE number 1910757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of bicoloring clique hypergraphs of graphs |
scientific article; zbMATH DE number 1910757 |
Statements
On the complexity of bicoloring clique hypergraphs of graphs (English)
0 references
14 May 2003
0 references
clique hypergraph
0 references
0.8129509091377258
0 references
0.8055583834648132
0 references
0.797124445438385
0 references
