Skip to Main content Skip to Navigation
Journal articles

Three ways to cover a graph

Abstract : 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 different way. Whereas the folded covering number has been investigated thoroughly for some covering classes, e.g., interval graphs and planar graphs, the local covering number has received little attention. We provide new bounds on each covering number with respect to the following covering classes: linear forests, star forests, caterpillar forests, and interval graphs. The classical graph parameters that result this way are interval number, track number, linear arboricity, star arboricity, and caterpillar arboricity. As input graphs we consider graphs of bounded degeneracy, bounded degree, bounded tree-width or bounded simple tree-width, as well as outerplanar, planar bipartite, and planar graphs. For several pairs of an input class and a covering class we determine exactly the maximum ordinary, local, and folded covering number of an input graph with respect to that covering class.
Document type :
Journal articles
Complete list of metadatas

Cited literature [54 references]  Display  Hide  Download
Contributor : Kolja Knauer <>
Submitted on : Monday, February 6, 2017 - 4:08:45 PM
Last modification on : Monday, May 11, 2020 - 10:58:09 AM
Long-term archiving on: : Sunday, May 7, 2017 - 2:30:20 PM


Files produced by the author(s)




Kolja Knauer, Torsten Ueckerdt. Three ways to cover a graph. Discrete Mathematics, Elsevier, 2016, 339, pp.745 - 758. ⟨10.1016/j.disc.2015.10.023⟩. ⟨hal-01457977⟩



Record views


Files downloads