Decompositions of complete multipartite graphs via generalized graceful labelings
Combinatorics
2012-10-17 v1
Abstract
We prove the existence of infinite classes of cyclic G-decompositions of the complete multipartite graph, G being a caterpillar, a hairy cycle or a cycle. All the results are obtained by the construction of d-divisible -labelings of G, introduced in [A. Pasotti, On d-graceful labelings, to appear on Ars Combin.] as a generalization of classical -labelings, whose existence implies that one of graph decompositions.
Keywords
Cite
@article{arxiv.1210.4370,
title = {Decompositions of complete multipartite graphs via generalized graceful labelings},
author = {A. Benini and A. Pasotti},
journal= {arXiv preprint arXiv:1210.4370},
year = {2012}
}