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

稀疏图的星染色

Star coloring of sparse graphs

Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang

摘要:

如果图的两个色类的并集导出一个星森林,则称图的顶点的一个正常着色为\emph{star coloring}。星色数$χ_s(G)$是获得星着色$G$所需的最小颜色数。本文研究了图$G$的星色数$χ_s(G)$与最大平均度$\mbox{Mad}(G)$之间的关系。证明了:(1)若$G$是一个具有$\mbox{Mad}(G) < \frac{26}{11}$的图,则有$χ_s(G)\leq 4$ . (2)如果$G$是一个具有$\mbox{Mad}(G) < \frac{18}{7}$且围长至少为6的图,则为$χ_s(G)\leq 5$。(3)如果$G$是一个具有$\mbox{Mad}(G) < \frac{8}{3}$且围长至少为6的图,则为$χ_s(G)\leq 6$。这些结果是通过证明这样的图允许一个特定的分解成一个森林和一些独立的集。

英文摘要:

A proper coloring of the vertices of a graph is called a \emph{star coloring} if the union of every two color classes induces a star forest. The star chromatic number $χ_s(G)$ is the smallest number of colors required to obtain a star coloring of $G$. In this paper, we study the relationship between the star chromatic number $χ_s(G)$ and the maximum average degree $\mbox{Mad}(G)$ of a graph $G$. We prove that: (1) If $G$ is a graph with $\mbox{Mad}(G) < \frac{26}{11}$, then $χ_s(G)\leq 4$. (2) If $G$ is a graph with $\mbox{Mad}(G) < \frac{18}{7}$ and girth at least 6, then $χ_s(G)\leq 5$. (3) If $G$ is a graph with $\mbox{Mad}(G) < \frac{8}{3}$ and girth at least 6, then $χ_s(G)\leq 6$. These results are obtained by proving that such graphs admit a particular decomposition into a forest and some independent sets.

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

↑