Unique-maximum and conflict-free coloring for hypergraphs and tree graphs (Q2891368)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6046528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unique-maximum and conflict-free coloring for hypergraphs and tree graphs |
scientific article; zbMATH DE number 6046528 |
Statements
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (English)
0 references
15 June 2012
0 references
0 references
0.971777081489563
0 references
0.9198856949806212
0 references
0.9108976125717164
0 references
0.910897433757782
0 references
0.806542158126831
0 references
