id: 05924889
dt: j
an: 05924889
au: Froncek, Dalibor
ti: Decomposition of complete graphs into small graphs.
so: Opusc. Math. 30, No. 3, 277-280 (2010).
py: 2010
pu: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie, Kraków;
    Wydawnictwa AHG, Kraków
la: EN
cc: 
ut: graph decomposition; graph labeling
ci: Zbl 0193.53204
li: doi:10.7494/OpMath.2010.30.3.277
ab: Summary: In [Theory Graphs, Int. Symp. Rome 1966, 349‒355 (1967; Zbl
    0193.53204)], {\it A. Rosa} proved that if a bipartite graph $G$ with
    $n$ edges has an $α$-labeling, then for any positive integer $p$ the
    complete graph $K_{2np+1}$ can be cyclically decomposed into copies of
    $G$. This has become a part of graph theory folklore since then. In
    this note we prove a generalization of this result. We show that every
    bipartite graph $H$ which decomposes $K_k$ and $K_m$ also decomposes
    $K_{km}$.
rv: