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

Font Size:  Small  Medium  Large

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

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

Valid XHTML 1.0 Transitional