A note on selective line-graphs and partition colorings

We extend a one-to-one correspondence between the set of all colorings of any graph and the set of all stable sets of an auxiliary graph, from graphs to partitioned graphs. This correspondence has an application to Selective Coloring and to Selective Max-Coloring. (C) 2019 Elsevier B.V. All rights reserved.