TY  - JOUR
ID  - Fronček2009
LB  - Fronček2009
AU  - Fronček, Dalibor
TI  - α<sub>2</sub>-labeling of graphs
ST  - α<sub>2</sub>-labeling of graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2009
VL  - 29
IS  - 4
SP  - 393
EP  - 397
DO  - http://dx.doi.org/10.7494/OpMath.2009.29.4.393
UR  - http://dx.doi.org/10.7494/OpMath.2009.29.4.393
AB  - We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\). This notion generalizes the \(\alpha\)-labeling introduced in 1967 by A. Rosa.
KW  - graph decomposition
KW  - graph labeling
SN  - 1232-9274
ER  -