2000 character limit reached
Minimum Rainbow $H$-Decompositions of Graphs (1704.01000v1)
Published 4 Apr 2017 in math.CO and cs.DM
Abstract: Given graphs $G$ and $H$, we consider the problem of decomposing a properly edge-colored graph $G$ into few parts consisting of rainbow copies of $H$ and single edges. We establish a close relation to the previously studied problem of minimum $H$-decompositions, where an edge coloring does not matter and one is merely interested in decomposing graphs into copies of $H$ and single edges.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.