An algorithm for Ls - colourations of undirected graphs is described. This algorithm guarantees an optimal colouration and the correct value of the s-chromatic number for an arbitrary graph. Moreover, it can be used in case of directed graphs too.
An Algorithm for Ls - Colourations
PUCCIO, Luigia
1988-01-01
Abstract
An algorithm for Ls - colourations of undirected graphs is described. This algorithm guarantees an optimal colouration and the correct value of the s-chromatic number for an arbitrary graph. Moreover, it can be used in case of directed graphs too.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
