Geodesic
On the $L(p,1)$-labelling of graphs
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

Voir la notice de l'article provenant de la source Episciences

In this paper we improve the best known bound for the $L(p,1)$-labelling of graphs with given maximal degree. 
@article{DMTCS_2005_special_250_a47,
     author = {Gon\c{c}alves, Daniel},
     title = {On the $L(p,1)$-labelling of graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3438},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3438/}
}
TY  - JOUR
AU  - Gonçalves, Daniel
TI  - On the $L(p,1)$-labelling of graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3438/
DO  - 10.46298/dmtcs.3438
LA  - en
ID  - DMTCS_2005_special_250_a47
ER  - 
%0 Journal Article
%A Gonçalves, Daniel
%T On the $L(p,1)$-labelling of graphs
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3438/
%R 10.46298/dmtcs.3438
%G en
%F DMTCS_2005_special_250_a47
Gonçalves, Daniel. On the $L(p,1)$-labelling of graphs. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3438. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3438/

Cité par Sources :