\(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs (Q2476252)

Let \(H\) be a fixed graph. An \(H\)-covering of a given graph \(G\) is a set \(\{H_1, H_2, \cdots, H_k\}\) of subgraphs (all graphs here are edge subgraphs) where each \(H_i\) is isomorphic to \(H\) and every edge of \(G\) is in some subgraph \(H_i\). Such a \(G\) is called an \(H\)-coverable graph. Such a covering is called a minimal covering if for every \(j\), the subgraph \(\displaystyle\bigcup_{i=1}^{k} H_i - H_j\) does not produce a covering of \(G\). Finally \(G\) is called an \textit{\(H\)-equicoverable graph} if every minimal \(H\)-covering of \(G\) is also a minimum \(H\)-covering of \(G\). The paper under review studies \(P_3\)-equicoverable graphs and establishes a complete classification of all \(P_3\)-equicoverable graphs.