Flexibility of planar graphs of girth at least six
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10416996" target="_blank" >RIV/00216208:11320/20:10416996 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=naEXJwnw4Y" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=naEXJwnw4Y</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.22567" target="_blank" >10.1002/jgt.22567</a>
Alternative languages
Result language
angličtina
Original language name
Flexibility of planar graphs of girth at least six
Original language description
Let G be a planar graph with a list assignment L. Suppose a preferred color is given for some of the vertices. We prove that if G has girth at least six and all lists have size at least three, then there exists an L-coloring respecting at least a constant fraction of the preferences.
Czech name
—
Czech description
—
Classification
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
Result continuities
Project
<a href="/en/project/GA17-04611S" target="_blank" >GA17-04611S: Ramsey-like aspects of graph coloring</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
—
Volume of the periodical
95
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
10
Pages from-to
457-466
UT code for WoS article
000522737100001
EID of the result in the Scopus database
2-s2.0-85082752186