Decomposing Cubic Graphs into Connected Subgraphs of Size Three

Laurent Bulteau, Guillaume Fertin, Anthony Labarre +2

Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subs…