Geodesic
Pair L(2, 1)-Labelings of Infinite Graphs
Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 1, pp. 257-269.

Voir la notice de l'article provenant de la source Library of Science

An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This article studies a generalization of the L(2, 1)-labeling. We assign sets with at least one element to vertices of G under some conditions.
Keywords: L(2, 1)-labeling 
@article{DMGT_2019_39_1_a19,
     author = {Yeh, Roger K.},
     title = {Pair {L(2,} {1)-Labelings} of {Infinite} {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {257--269},
     publisher = {mathdoc},
     volume = {39},
     number = {1},
     year = {2019},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2019_39_1_a19/}
}
TY  - JOUR
AU  - Yeh, Roger K.
TI  - Pair L(2, 1)-Labelings of Infinite Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2019
SP  - 257
EP  - 269
VL  - 39
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2019_39_1_a19/
LA  - en
ID  - DMGT_2019_39_1_a19
ER  - 
%0 Journal Article
%A Yeh, Roger K.
%T Pair L(2, 1)-Labelings of Infinite Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2019
%P 257-269
%V 39
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2019_39_1_a19/
%G en
%F DMGT_2019_39_1_a19
Yeh, Roger K. Pair L(2, 1)-Labelings of Infinite Graphs. Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 1, pp. 257-269. http://geodesic.mathdoc.fr/item/DMGT_2019_39_1_a19/

[1] T. Calamoneri, The L(h, k)-labeling problem: A updated survey and annotated bib- liography, Comput. J. 54 (2011) 1344-1371. doi: 10.1093/comjnl/bxr037

[2] P.C. Fishburn and F.S. Roberts, No-hole L(2, 1)-colorings, Discrete Appl. Math. 130 (2003) 513-519. doi: 10.1016/S0166-218X(03)00329-9

[3] Z. Füredi, J.R. Griggs and D. Kleitman, Pair labelings with given distance, SIAM J. Discrete Math. 2 (1989) 491-499. doi: 10.1137/0402044

[4] J.R. Griggs and X.T. Jin, Real number labellings for paths and cycles, Internet Math. 4 (2007) 65-86. doi: 10.1080/15427951.2007.10129140

[5] J.R. Griggs and X.T. Jin, Real number channel assignments for lattices, SIAM J. Discrete Math. 22 (2008) 996-1021. doi: 10.1137/060650982

[6] J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992) 586-595. doi: 10.1137/0405048

[7] F.S. Roberts, Workshop group agenda, DIMACS/DIMATIA/Renyi working group on graph colorings and their generalizations, posted at http://dimacs.rutgers,edu/Workshops/GraphColor/main.html, 2003.

[8] R.K. Yeh, A survey on labeling graphs with a condition at distance two, Discrete Math. 306 (2006) 1217-1231. doi: 10.1016/j.disc.2005.11.029.