A note on selective line-graphs and partition colorings
Résumé
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.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)