arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.08892math.CO
收藏

次三次重图的星5-边染色

Star 5-edge-colorings of subcubic multigraphs

Hui Lei, Yongtang Shi, Zi-Xia Song, Tao Wang

摘要:

多重图$G$的星色指数,记为$χ'_{s}(G)$,是正确着色$G$的边所需的最小颜色数,使得没有长度为4的路或圈是双色的。一个多重图$G$是星$k$ -边可着色的,如果$χ'_{s}(G)\le k$。Dvoák,Mohar and Šámal [Star chromatic index,J Graph Theory 72(2013),313- 326]证明了每个次三重图都是星$7$ -边可着色的,并证明了每个次三重图都应该是星$6$ -边可着色的. Kerdjoudj,Kostochka和Raspaud考虑了简单图的列表问题,证明了最大平均度小于$7/3$的次立方图是星列表- $5$ -边可着色的.已知具有最大平均度$14/5$的图不一定是星$5$ -边可着色的。本文证明了最大平均度小于$12/5$的次三重图是星$5$ -边可着色的.

英文摘要:

The star chromatic index of a multigraph $G$, denoted $χ'_{s}(G)$, is the minimum number of colors needed to properly color the edges of $G$ such that no path or cycle of length four is bi-colored. A multigraph $G$ is star $k$-edge-colorable if $χ'_{s}(G)\le k$. Dvořák, Mohar and Šámal [Star chromatic index, J Graph Theory 72 (2013), 313--326] proved that every subcubic multigraph is star $7$-edge-colorable, and conjectured that every subcubic multigraph should be star $6$-edge-colorable. Kerdjoudj, Kostochka and Raspaud considered the list version of this problem for simple graphs and proved that every subcubic graph with maximum average degree less than $7/3$ is star list-$5$-edge-colorable. It is known that a graph with maximum average degree $14/5$ is not necessarily star $5$-edge-colorable. In this paper, we prove that every subcubic multigraph with maximum average degree less than $12/5$ is star $5$-edge-colorable.

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

↑