Labelings of unions of up to four uniform cycles

Diane M. Donovan, Saad I. El-Zanati, Charles Vanden Eynden, Somporn Sutinuntopas
2004 The Australasian Journal of Combinatorics  
We show that every 2-regular graph consisting of at most four uniform components has a ρ-labeling (or a more restricted labeling). This has an application in the cyclic decomposition of certain complete graphs into the disjoint unions of cycles.
dblp:journals/ajc/DonovanEES04 fatcat:nvmrn3zu25d6tmioimzme23uli