On generalized choice and coloring numbers (Q1733934)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On generalized choice and coloring numbers |
scientific article |
Statements
On generalized choice and coloring numbers (English)
0 references
22 March 2019
0 references
Summary: A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph parameter.
0 references
0 references
