Wyniki wyszukiwania dla: SUBCOLORING

• Dynamic F-free Coloring of Graphs

  Publikacja

  • P. Borowiecki
  • E. Sidorowicz

  - GRAPHS AND COMBINATORICS - Rok 2018

  A problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...

  Pełny tekst do pobrania w portalu