Decompositions of complete multipartite graphs via generalized graceful labelings
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.