arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.10962math.CO
收藏

关于图幂的染色数

On coloring numbers of graph powers

H. A. Kierstead, Daqing Yang, Junjun Yi

摘要:

图$G$的弱$r$ -色数$wcol_r(G)$是由前两位作者作为通常的色数$col(G)$的推广而引入的,并且已经在理论和算法上得到了有趣的应用.这促使研究人员为各类图建立这些参数的强界。令$G^p$表示$G$的$p$次幂。我们证明了,所有的整数$p >0$和$Δ\ge 3$以及图$G$与$Δ(G) \leq Δ$满足$col(G^p) \in O(p \cdot wcol_{\lceil p/2\rceil}(G)(Δ-1)^{\lfloor p/2\rfloor})$ ;对于固定的树宽或固定的亏格,这个上界与最坏情况下界的比值在$p$中是多项式的.对于平方图$G$,我们还证明了,如果最大平均度$2k-2 < mad(G) \leq 2k$,则$ col(G^2) \leq (2k-1)Δ(G)+2k+1$ .

英文摘要:

The weak $r$-coloring numbers $wcol_r(G)$ of a graph $G$ were introduced by the first two authors as a generalization of the usual coloring number $col(G)$, and have since found interesting theoretical and algorithmic applications. This has motivated researchers to establish strong bounds on these parameters for various classes of graphs. Let $G^p$ denote the $p$-th power of $G$. We show that, all integers $p >0$ and $Δ\ge 3$ and graphs $G$ with $Δ(G) \leq Δ$ satisfy $col(G^p) \in O(p \cdot wcol_{\lceil p/2\rceil}(G)(Δ-1)^{\lfloor p/2\rfloor})$; for fixed tree width or fixed genus the ratio between this upper bound and worst case lower bounds is polynomial in $p$. For the square of graphs $G$, we also show that, if the maximum average degree $2k-2 < mad(G) \leq 2k$, then $ col(G^2) \leq (2k-1)Δ(G)+2k+1$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑