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.
Dettaglio pubblicazione
2019, OPERATIONS RESEARCH LETTERS, Pages 565-568 (volume: 47)
A note on selective line-graphs and partition colorings (01a Articolo in rivista)
Cornaz D., Furini F., Malaguti E., Santini A.
keywords