Extension from Precoloured Sets of Edges

Electronic Journal Of Combinatorics

Katherine Edwards¹ 

关键词: Edge-colouring;    Precolouring extension;    Multigraphs;    List colouring;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 $\Delta$.

【 授权许可】

Others