A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Three ways to cover a graph
[article]
2015
arXiv
pre-print
We consider the problem of covering an input graph H with graphs from a fixed covering class G. The classical covering number of H with respect to G is the minimum number of graphs from G needed to cover the edges of H without covering non-edges of H. We introduce a unifying notion of three covering parameters with respect to G, two of which are novel concepts only considered in special cases before: the local and the folded covering number. Each parameter measures "how far" H is from G in a
arXiv:1205.1627v3
fatcat:clp6x5vpb5cprcoz34zhcz5zsy