In this work we give a new lower bound on the chromatic number of a Mycielski graph M-i. The result exploits a mapping between the coloring problem and a multiprocessor task scheduling problem. The tightness of the bound is proved for i = 1,...,8, (C) 2001 Elsevier Science B.V, All rights reserved.
A lower bound on the chromatic number of Mycielski graphs / Massimiliano, Caramia; Dell'Olmo, Paolo. - In: DISCRETE MATHEMATICS. - ISSN 0012-365X. - STAMPA. - 235:1-3(2001), pp. 79-86. [10.1016/s0012-365x(00)00261-2]
A lower bound on the chromatic number of Mycielski graphs
DELL'OLMO, Paolo
2001
Abstract
In this work we give a new lower bound on the chromatic number of a Mycielski graph M-i. The result exploits a mapping between the coloring problem and a multiprocessor task scheduling problem. The tightness of the bound is proved for i = 1,...,8, (C) 2001 Elsevier Science B.V, All rights reserved.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
