All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Thomassen-type method for planar graph recoloring

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10437042" target="_blank" >RIV/00216208:11320/21:10437042 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=vD59WgZ5mb" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=vD59WgZ5mb</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ejc.2021.103319" target="_blank" >10.1016/j.ejc.2021.103319</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Thomassen-type method for planar graph recoloring

  • Original language description

    The reconfiguration graph R-k(G) for the k-colorings of a graph G has as vertices all possible 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 for a planar graph G with n vertices, R-12(G) has diameter at most 6n, and if G is triangle-free, then R-8(G) has diameter at most 4n. We use a list coloring technique inspired by results of Thomassen to improve on the number of colors, showing that for a planar graph G with n vertices, R-10(G) has diameter at most 8n, and if G is triangle-free, then R-7(G) has diameter at most 7n. (C) 2021 Elsevier Ltd. All rights reserved.

  • 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

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • 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)

Others

  • Publication year

    2021

  • 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

    European Journal of Combinatorics

  • ISSN

    0195-6698

  • e-ISSN

  • Volume of the periodical

    95

  • Issue of the periodical within the volume

    june 2021

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    12

  • Pages from-to

    103319

  • UT code for WoS article

    000652025600010

  • EID of the result in the Scopus database

    2-s2.0-85101551729