Contraction of triangles is a standard operation in the study of cubic graphs, as it reduces the order of the graph while typically preserving many of its properties. In this paper, we investigate the converse problem, wherein certain vertices of cubic graphs are expanded into triangles to achieve a desired property. We first focus on bridgeless cubic graphs and define the parameter T (G) as the minimum number of vertices that need to be expanded into triangles so that the resulting cubic graph can be covered with four perfect matchings. We relate this parameter to the concept of shortest cycle cover. Furthermore, we show that if 5-Cycle Double Cover Conejcture holds true, then T (G) ≤ 2/5 |V (G)|. We conjecture a tighter bound, T (G) ≤ 1/10 |V (G)|, which is optimal for the Petersen graph, and show that this bound follows from major conjectures like the Petersen Coloring Conjecture. In the second part of the paper, we introduce the parameter t(G) as the minimum number of vertex expansions needed for the graph to admit a perfect matching. We prove a Gallai type identity: t(G) + ℓ(G) = |V (G)|, where ℓ(G) is the number of edges in a largest even subgraph of G. Then we prove the general upper bound t(G) < 1/4 |V (G)| for cubic graphs, and t(G) < 1/6 |V (G)| for cubic graphs without parallel edges. We provide examples showing that these bounds are asymptotically tight. The paper concludes with a discussion of the computational complexity of determining these parameters.
Mazzuoccolo et al. (Mon,) studied this question.