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

预着色边集的延拓

Extension from Precoloured Sets of Edges

Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni

摘要:

我们考虑预着色扩展问题的适当的边着色的图和多重图,试图证明更强的版本Vizing的和香农的边界上的色指数(多)图的最大程度$Δ$。我们特别感兴趣的是以下问题:当它是可能的延伸一个precoloured匹配着色的所有边的(多)图?这个问题被证明与臭名昭著的列表着色猜想和其他经典的可选择性概念有关。

英文摘要:

We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the chromatic index of (multi)graphs in terms of their maximum degree $Δ$. We are especially interested in the following question: when is it possible to extend a precoloured matching to a colouring of all edges of a (multi)graph? This question turns out to be related to the notorious List Colouring Conjecture and other classic notions of choosability.

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

↑