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

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

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

Bibliographic Details
Main Author: Daniel Gonçalves
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2005-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
lambda-labelling
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
Online Access:https://dmtcs.episciences.org/3438/pdf

Similar Items

Similar Items