Dynamic coloring on restricted graph classes

A proper k-coloring of a graph is an assignment of colors from the set {1,2,…,k} to the vertices of the graph such that no two adjacent vertices receive the same color. Given a graph G and an integer k, the Dynamic Coloring problem asks whether there exists a proper k-coloring of G such that for eve...

Ausführliche Beschreibung