A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Labelings of unions of up to four uniform cycles
2004
The Australasian Journal of Combinatorics
Preserved Fulltext
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