Loading [MathJax]/jax/output/HTML-CSS/jax.js

Daniel Gonçalves - On the L(p,1)-labelling of graphs

dmtcs:3438 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3438
On the L(p,1)-labelling of graphsConference paper

Authors: Daniel Gonçalves ORCID1

  • 1 Laboratoire Bordelais de Recherche en Informatique

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

https://doi.org/10.46298/dmtcs.3438
Source: HAL:hal-01184395v1
Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: lambda-labelling,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

4 Documents citing this article

Share and export

Consultation statistics

This page has been seen 284 times.
This article's PDF has been downloaded 241 times.