Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q5408592): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:05, 9 February 2024
scientific article; zbMATH DE number 6282651
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs |
scientific article; zbMATH DE number 6282651 |
Statements
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (English)
0 references
10 April 2014
0 references
graph coloring
0 references
hypergraph coloring
0 references
conflict-free coloring
0 references
unique-maximum coloring
0 references
odd coloring
0 references
conflict-free chromatic number
0 references
unique-maximum chromatic number
0 references
odd chromatic number
0 references
