Dina Rizki Anggraini., Dafik., Susi Setiawani(2016-02-18)
All graph in this paper are finite, simple and undirected.
By $H'$-covering, we mean every edge in $E(G)$ belongs to at least
one subgraph of $G$ isomorphic to a given graph $H$. A graph $G$ is
said to be an $(a, ...