@Article{Fronček2009,
author = "Fronček, Dalibor",
title = "α<sub>2</sub>-labeling of graphs",
journal = "Opuscula Math.",
year = "2009",
volume = "29",
number = "4",
pages = "393--397",
doi = "http://dx.doi.org/10.7494/OpMath.2009.29.4.393",
url = "http://dx.doi.org/10.7494/OpMath.2009.29.4.393",
abstract = "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.",
keywords = "graph decomposition, graph labeling",
issn = "1232-9274"
}