2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Stefan Felsner (ed.)
DMTCS Conference Volume AE (2005), pp. 8186
author:  Daniel Gonçalves 

title: 
On the
L(p,1)
labelling of graphs

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

If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.  
reference: 
Daniel Gonçalves (2005), On the
L(p,1)
labelling of graphs, in 2005 European Conference
on Combinatorics, Graph Theory and Applications (EuroComb
'05), Stefan Felsner (ed.), Discrete Mathematics
and Theoretical Computer Science Proceedings AE, pp.
8186

bibtex:  For a corresponding BibTeX entry, please consider our BibTeXfile. 
ps.gzsource:  dmAE0117.ps.gz (53 K) 
pssource:  dmAE0117.ps (131 K) 
pdfsource:  dmAE0117.pdf (133 K) 
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.
Automatically produced on Di Sep 27 10:09:44 CEST 2005 by gustedt