On the $L(p,1)$-labelling of graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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

Abstract

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

Keywords

Fichier principal
Vignette du fichier
dmAE0117.pdf (133.65 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184395 , version 1 (14-08-2015)

Identifiers

Cite

Daniel Gonçalves. On the $L(p,1)$-labelling of graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.81-86, ⟨10.46298/dmtcs.3438⟩. ⟨hal-01184395⟩
131 View
630 Download

Altmetric

Share

Gmail Facebook X LinkedIn More