Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs |
scientific article |
Statements
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (English)
0 references
15 June 2012
0 references
0 references
