circular choosability conjecture
E1654976
UNEXPLORED
The circular choosability conjecture is a graph theory conjecture about when a graph admits a circular list coloring, refining ordinary list coloring by using a circular (fractional) notion of chromatic number.
All labels observed (1)
| Label | Occurrences |
|---|---|
| circular choosability conjecture canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.