Abstract
We prove that the list-chromatic index and paintability index of K 6 is 5. That indeed χℓ′(K6)=5 was a still open special case of the List Coloring Conjecture. Our proof demonstrates how colorability problems can numerically be approached by the use of computer algebra systems and the Combinatorial Nullstellensatz.
| Original language | English |
|---|---|
| Pages (from-to) | 15-18 |
| Number of pages | 4 |
| Journal | Discrete Mathematics |
| Volume | 322 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 6 May 2014 |
Keywords
- Combinatorial Nullstellensatz
- Complete graph
- Computer algebra systems
- Edge coloring
- List coloring
- List coloring conjecture
- List-chromatic index