On the  L(p,1) -labelling of graphs

DMTCS Proceedings, 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)

Daniel Gonçalves

In this paper we improve the best known bound for the L(p,1)-labelling of graphs with given maximal degree.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page