×

On Rosa-type labelings and cyclic graph decompositions. (English) Zbl 1199.05299

If \(K\) and \(G\) are graphs with \(G\) a subgraph of \(K\), a decomposition of \(K\) into edge-disjoint subgraphs isomorphic to \(G\) is called a \(G\)-decomposition of \(K\). A labeling of a graph \(G\) is an assignment of integers to the vertices of \(G\) subject to certain conditions. Rosa-type labelings are labelings with applications to cyclic graph decompositions. This paper provides an elegant survey of various Rosa-type labelings of a graph \(G\) that lead to \(G\)-decompositions of some complete or complete bipartite graphs.

MSC:

05C78 Graph labelling (graceful graphs, bandwidth, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.