Minimum Rainbow $H$-Decompositions of Graphs
Combinatorics
2017-04-05 v1 Discrete Mathematics
Abstract
Given graphs and , we consider the problem of decomposing a properly edge-colored graph into few parts consisting of rainbow copies of and single edges. We establish a close relation to the previously studied problem of minimum -decompositions, where an edge coloring does not matter and one is merely interested in decomposing graphs into copies of and single edges.
Cite
@article{arxiv.1704.01000,
title = {Minimum Rainbow $H$-Decompositions of Graphs},
author = {Lale Özkahya and Yury Person},
journal= {arXiv preprint arXiv:1704.01000},
year = {2017}
}