1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Rachel Wulan Nirmalasari Wijaya, Andrea Semaničová-Feňovčíková, Joe Ryan +1
A simple graph G=(V,E) admits an H-covering if every edge in E is contained in a subgraph H′=(V′,E′) of G which is isomorphic to H. In this case we say that G is H-…