An update on reconfiguring 10-colorings of planar graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10422894" target="_blank" >RIV/00216208:11320/20:10422894 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=c_0T4mPRdr" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=c_0T4mPRdr</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.37236/9391" target="_blank" >10.37236/9391</a>

Result language
angličtina
Original language name
An update on reconfiguring 10-colorings of planar graphs
Original language description
The reconfiguration graph R-k(G) for the k-colorings of a graph G has as vertex set the set of all possible proper k-colorings of G and two colorings are adjacent if they differ in the color of exactly one vertex. A result of Bousquet and Perarnau (2016) regarding graphs of bounded degeneracy implies that if G is a planar graph with n vertices, then R-12(G) has diameter at most 6n. We improve on the number of colors, showing that R-10(G) has diameter at most 8n for every planar graph G with n vertices.
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
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA19-21082S" target="_blank" >GA19-21082S: Graphs and their algebraic properties</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)