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

图的$t$ -调染色的新结果

New results in $t$-tone coloring of graphs

Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley

摘要:

$G$的$t$ -色调$k$ -着色将来自$\{1,..., k\}$的$t$颜色集合分配给$G$的每个顶点,使得在距离$d$处的顶点共享比$d$公共颜色少的公共颜色。$G$的{ \it $t$ -色调色数},记为$τ_t(G)$,是使$G$具有$t$ -色调$k$ -着色的最小$k$. Bickle和菲利普斯表明,总是$τ_2(G) \le [Δ(G)]^2 + Δ(G)$,但强调,事实上$τ_2(G) \le 2Δ(G) + 2$ ;我们确认这一猜想时,$Δ(G) \le 3$,也表明,总是$τ_2(G) \le \ceil{(2 + \sqrt{2})Δ(G)}$。对于一般的$t$,我们证明了$τ_t(G) \le (t^2+t)Δ(G)$ .最后,对于每个$t\ge 2$,我们表明,存在常数$c_1$和$c_2$,使得对于每棵树$T$,我们有$c_1 \sqrt{Δ(T)} \le τ_t(T) \le c_2\sqrt{Δ(T)}$。

英文摘要:

A $t$-tone $k$-coloring of $G$ assigns to each vertex of $G$ a set of $t$ colors from $\{1,..., k\}$ so that vertices at distance $d$ share fewer than $d$ common colors. The {\it $t$-tone chromatic number} of $G$, denoted $τ_t(G)$, is the minimum $k$ such that $G$ has a $t$-tone $k$-coloring. Bickle and Phillips showed that always $τ_2(G) \le [Δ(G)]^2 + Δ(G)$, but conjectured that in fact $τ_2(G) \le 2Δ(G) + 2$; we confirm this conjecture when $Δ(G) \le 3$ and also show that always $τ_2(G) \le \ceil{(2 + \sqrt{2})Δ(G)}$. For general $t$ we prove that $τ_t(G) \le (t^2+t)Δ(G)$. Finally, for each $t\ge 2$ we show that there exist constants $c_1$ and $c_2$ such that for every tree $T$ we have $c_1 \sqrt{Δ(T)} \le τ_t(T) \le c_2\sqrt{Δ(T)}$.

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

↑