… on the recoloring diameter can … graph G and every k ≥ 2 d , the recoloring diameter of G is
at most d n . In Section 3, we study the k -recoloring diameter from another invariant of graphs …

… ′ is to recolor a vertex in N ( v ) with c 1 , we recolor v with a … σ is to recolor a vertex in
N ( v ) with c s + 1 , we recolor v with … Continuing in this way, we extend σ ′ to an L -recoloring …

… every graph G belonging to some special graph class such as, for example, chordal and
chordal bipartite … Recoloring graphs via tree decompositions … Fast recoloring of sparse graphs …

… sparse graph regularization. Firstly, a few color strokes are interactively drawn by the user,
and then the color will be propagated to the whole mesh by minimizing a sparse graph … sparse …

… local changes faster than recomputing everything from scratch. Such algorithms are called
dynamic (graph) algorithms. In this paper, we consider a variant of dynamic graph algorithm …

… Most of the research so far has focused on obtaining fast algorithms for coloring graphs of
… (Actually our recoloring process might modify the colors of some vertices of G \ A). To show …

… In Tables 18 and 19, we also compare the recolor variant to the faster but less accurate …
of our methods on a diverse set of graphs, from large sparse graphs (eg, social and biological …

… We fix these conflicts greedily by simulating the following centralized recoloring process: all
… In order to simulate the recoloring process in AMPC, we make the observation that the final …

… In this case, we claim that if we recolor s∗ with the color c′(k∗∗) we will create a coloring
c′′ such … Olariu, “A fast parallel algorithm to recognize P4-sparse graphs,” Discrete Applied …

… bounds on the mixing number of graphs and prove that the corresponding recoloring
diameter is polynomial. Note that there exists a family of graphs for which there are two colorings …