Given a graph G, and positive integers k, q, pack the edges of G in (pairwise edge disjoint) connected sub-graphs, each of size (number of edges) at most k, and such that, no vertex is part of more than q of these connected sub-graphs.What is the closet related problem already studied? What can be said in case we restrict to k=3, q=2, and graphs of maximum degree 3?
Packing the edges of a graph
algorithms;graphs;packing