Back to Search
Start Over
Extracting List Colorings from Large Independent Sets.
- Source :
-
Journal of Graph Theory . Nov2017, Vol. 86 Issue 3, p315-328. 14p. - Publication Year :
- 2017
-
Abstract
- We take an application of the Kernel Lemma by Kostochka and Yancey [11] to its logical conclusion. The consequence is a sort of magical way to draw conclusions about list coloring (and online list coloring) just from the existence of an independent set incident to many edges. We use this to prove an Ore-degree version of Brooks' Theorem for online list-coloring. The Ore-degree of an edge [ABSTRACT FROM AUTHOR]
- Subjects :
- *INDEPENDENT sets
*GRAPH coloring
*EXISTENCE theorems
*SET theory
*EDGES (Geometry)
Subjects
Details
- Language :
- English
- ISSN :
- 03649024
- Volume :
- 86
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Journal of Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 125070897
- Full Text :
- https://doi.org/10.1002/jgt.22128