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.

Podrobná bibliografie
Hlavní autor:	Daniel Gonçalves
Médium:	Článek
Jazyk:	English
Vydáno:	Discrete Mathematics & Theoretical Computer Science 2005-01-01
Edice:	Discrete Mathematics & Theoretical Computer Science
Témata:	lambda-labelling [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co]
On-line přístup:	https://dmtcs.episciences.org/3438/pdf

Internet

https://dmtcs.episciences.org/3438/pdf