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

图的奇偶边染色

Parity Edge-Coloring of Graphs

David P. Bunde, Kevin Milans, Douglas B. West, Hehui Wu

摘要:

在边着色的图中,奇偶游走是指使用每种颜色偶数次的游走。图G的奇偶边色数p(G)是最小的k,使得E(G)有k个不含奇偶路的着色,图G的强奇偶边色数p '(G)是最小的k,使得E(G)有k个奇偶路闭的着色.我们的主要结果是确定p '(K_n)。具体地说,如果m是与n一样大的2的最小幂,则p '(K_n)具有值m - 1。作为推论,我们加强了Daykin和Lovasz的一个旧结果的特殊情况。其它结果包括当G是路、圈或K_{2,n}形式时确定p(G)和p '(G),以及当G是完全二部图时确定p'(G)的上界.最后,我们以一个开放性问题的例子来结束。

英文摘要:

In a graph whose edges are colored, a parity walk is a walk that uses each color an even number of times. The parity edge chromatic number p(G) of a graph G is the least k so that there is a coloring of E(G) using k colors that does not contain a parity path. The strong parity edge chromatic number p'(G) of G is the least k so that there is a coloring of E(G) using k colors with the property that every parity walk is closed. Our main result is to determine p'(K_n). Specifically, if m is the least power of two that is as large as n, then p'(K_n) has value m - 1. As a corollary, we strengthen a special case of an old result of Daykin and Lovasz. Other results include determining p(G) and p'(G) whenever G is a path, cycle, or of the form K_{2,n}, and an upper bound on p'(G) for the case that G is a complete bipartite graph. We conclude with a sample of open problems.

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

↑