"Colouring a graph frugally"

LIAFA

Laboratoire d'Informatique Algorithmique: Fondements et Applications

CNRS UMR 7089, Université Paris Diderot - Paris 7, Case 7014
75205 Paris Cedex 13 - Tél: +33(0)1.57.27.92.56 - Fax: +33(0)1.57.27.94.09

Research reports

Report number: 1995-082
Authors: H. HIND, M. MOLLOY, B. REED
Title: Colouring a graph frugally
Summary:

We study proper vertex colouring in which the number of times a colour can appear in any vertices neighbourhood is bounded.

Complete report:
PostScript file compressed with gzip
PostScript format
pdf format


© LIAFA 1995, Last updating: 2013, May	webmestre[at]liafa.univ-paris-diderot.fr