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.
Cornaz D., Furini F., Malaguti E., Santini A. (2019). A note on selective line-graphs and partition colorings. OPERATIONS RESEARCH LETTERS, 47(6), 565-568 [10.1016/j.orl.2019.08.005].
A note on selective line-graphs and partition colorings
Malaguti E.;
2019
Abstract
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.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
