Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10385400" target="_blank" >RIV/00216208:11320/18:10385400 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.jctb.2017.09.001" target="_blank" >https://doi.org/10.1016/j.jctb.2017.09.001</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2017.09.001" target="_blank" >10.1016/j.jctb.2017.09.001</a>

Result language
angličtina
Original language name
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
Original language description
We introduce a new variant of graph coloring called correspondence colming which generalizes list coloring and allows for reductions previously only possible for ordinary coloring. Using this tool, we prove that excluding cycles of lengths 4 to 8 is sufficient to guarantee 3-choosability of a planar graph, thus answering a question of Borodin.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GA14-19503S" target="_blank" >GA14-19503S: Graph coloring and structure</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)