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.
A note on selective line-graphs and partition colorings / Cornaz, D.; Furini, F.; Malaguti, E.; Santini, A.. - In: OPERATIONS RESEARCH LETTERS. - ISSN 0167-6377. - 47:6(2019), pp. 565-568. [10.1016/j.orl.2019.08.005]
A note on selective line-graphs and partition colorings
Furini F.
;
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 allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
Cornaz_preprint_A-note_2019.pdf
accesso aperto
Note: https://doi.org/10.1016/j.orl.2019.08.005
Tipologia:
Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
139.89 kB
Formato
Adobe PDF
|
139.89 kB | Adobe PDF | |
|
Cornaz_A-note_2019.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
316.59 kB
Formato
Adobe PDF
|
316.59 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
