Let (T,C) be a pair consisting of a tree T and a coloring C of its vertices. We say that C is a c... more Let (T,C) be a pair consisting of a tree T and a coloring C of its vertices. We say that C is a convex coloring if, for each color, the vertices in T with the same color induces a subtree of T. The convex recoloring problem (of trees) is defined as follows. Given a pair (T,C), find a recoloring of
Let (T,C) be a pair consisting of a tree T and a coloring C of its vertices. We say that C is a c... more Let (T,C) be a pair consisting of a tree T and a coloring C of its vertices. We say that C is a convex coloring if, for each color, the vertices in T with the same color induces a subtree of T. The convex recoloring problem (of trees) is defined as follows. Given a pair (T,C), find a recoloring of
Uploads