On the coloring of \(C\)-hypergraphs with minimum connected pair graphs (Q5452990)
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 coloring of C-hypergraphs with minimum connected pair graphs |
scientific article; zbMATH DE number 5259845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the coloring of \(C\)-hypergraphs with minimum connected pair graphs |
scientific article; zbMATH DE number 5259845 |
Statements
4 April 2008
0 references
mixed hypergraph
0 references
strict coloring
0 references
upper chromatic number
0 references
connected pair graph
0 references
0.8455705046653748
0 references
0.8372101783752441
0 references
0.8170861005783081
0 references
0.8145972490310669
0 references
