TAMC
2010
Springer
14 years 23 days ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...