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

某些图族的协作着色

Cooperative coloring of some graph families

Xuqing Bai, Bi Li, Chuandong Xu, Xin Zhang

AI总结:

本文研究了共享顶点集的图族协作着色问题,确定了树和轮图类所需的最小图数,并证明了平衡完全二分图与广义theta图类的最小图数上界。

摘要:

在共享同一顶点集 $V$ 的图族 ${G_1, G_2, \ldots, G_m}$ 中,协作着色是指为每个 $i\in \{1,2,\ldots,m\}$ 从 $G_i$ 中选择一个独立集 $I_i$,使得 $\bigcup_{i=1}^m I_i = V$。对于图类 $\mathcal{G}$,令 $m_{\mathcal{G}}(d)$ 表示为确保同一顶点集上的任意图族 ${G_1, G_2, \ldots, G_m}$(其中 $G_i\in\mathcal{G}$ 且 $Δ(G_i)\leq d$)均存在协作着色所需的最小 $m$。对于图类 $\mathcal{T}$(树)和 $\mathcal{W}$(轮图),我们得出 $m_\mathcal{T}(3)=4$ 且 $m_\mathcal{W}(4)=5$。此外,我们证明了 $m_{\mathcal{B}^*}(d)=O(\log_2 d)$ 以及 $m_{\mathcal{L}}(d)=O\left(\frac{\log d}{\log\log d}\right)$,其中 $\mathcal{B}^*$ 代表其连通分量为平衡完全二分图的图类,$\mathcal{L}$ 代表其连通分量为广义theta图的图类。

英文摘要:

In a family ${G_1, G_2, \ldots, G_m}$ of graphs sharing the same vertex set $V$, a cooperative coloring involves selecting one independent set $I_i$ from $G_i$ for each $i\in \{1,2,\ldots,m\}$ such that $\bigcup_{i=1}^m I_i = V$. For a graph class $\mathcal{G}$, let $m_{\mathcal{G}}(d)$ denote the minimum $m$ required to ensure that any graph family ${G_1, G_2, \ldots, G_m}$ on the same vertex set, where $G_i\in\mathcal{G}$ and $Δ(G_i)\leq d$ for each $i\in \{1,2,\ldots,m\}$, admits a cooperative coloring. For the graph classes $\mathcal{T}$ (trees) and $\mathcal{W}$ (wheels), we find that $m_\mathcal{T}(3)=4$ and $m_\mathcal{W}(4)=5$. Also, we prove that $m_{\mathcal{B}^*}(d)=O(\log_2 d)$ and $m_{\mathcal{L}}(d)=O\left(\frac{\log d}{\log\log d}\right)$, where $\mathcal{B}^*$ represents the class of graphs whose components are balanced complete bipartite graphs, and $\mathcal{L}$ represents the class of graphs whose components are generalized theta graphs.

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

↑