… coloring parameter of a graph called the strict strong coloring (short SSColoring). A SSColoring
of a graph G is a vertex proper coloring of … not empty color class. The minimum number of …

… colorings only by changing the colors … strong connection between strains of Tuberculosis
and their human carriers. In this work we define and study a natural distance from a colored tree …

… to the number of colors in some centered coloring of G : Let Y be a rooted tree of height td
( G ) , such that G ⊆ clos ( Y ) . Color each vertex by its height in Y , thus using td ( G ) colors. …

… Because of the increase in the degree, even tight bounds for trees do not translate into tight
bounds for boundeddegree graphs. Even some of the results we expect to carry over from …

… strict strong graph coloring (SSColoring). This graph coloring task aims at finding the
minimum number of colors … A strict strong coloring of trees. Inf Process Lett. 2009;109(18):1047–54. …

… It is the only algorithm which gives an exact SSColoring for any tree in polynomial time. The
… of trees and in the same time coloring them with an exact and an appropriate number of …

… strictly between ACA 0 and RT 2 2 . The proof of this fact uses an extension of the bushy tree
… techniques for dealing with combinatorial statements formulated on trees, rather than on ω. …

… tree decomposition method we propose is based on a recent work on graph coloring that
allows an original way to consider a tree … This distance will be called the strict strong distance, …

… of coloring a planar graph with the minimum number of colors such that each color class …
T-free 2-coloring of planar graphs for the case where T is a tree with at least two edges (see …

… We consider the problem of coloring a planar graph with the minimum number of colors so
that each color class avoids … The 2-coloring problem is NP-hard if the forbidden subgraph is a …