Three ways to cover a graph
Three ways to cover a graph
复制标题
覆盖图表的三种方法
DOI:
10.1016/j.disc.2015.10.023
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
Torsten Ueckerdt
中科院分区:
文献类型:
--
作者:
Kolja B. Knauer;Torsten Ueckerdt
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, eg, 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.
登录
查看更多内容
DOI:
--
发表时间:
1999
期刊:
影响因子:
--
作者:
A. Kostochka;D. West
通讯作者:
D. West
影响因子:
1.1
作者:
Minghui Jiang
通讯作者:
Minghui Jiang
DOI:
--
发表时间:
2007
期刊:
Graphs Comb.
影响因子:
--
作者:
Jinquan Dong;Yanpei Liu
通讯作者:
Yanpei Liu
影响因子:
0.7
作者:
Trevor Pinto
通讯作者:
Trevor Pinto
DOI:
--
发表时间:
2011
期刊:
Latin American Symposium on Theoretical Informatics
影响因子:
--
作者:
Daniel Heldt;K. Knauer;T. Ueckerdt
通讯作者:
T. Ueckerdt