α_{2}-labeling of graphs

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\)-labe...

Full description

Bibliographic Details
Main Author: Dalibor Fronček
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2009-01-01
Series:Opuscula Mathematica
Subjects:
Online Access:http://www.opuscula.agh.edu.pl/vol29/4/art/opuscula_math_2930.pdf