Library Header Image
LSE Research Online LSE Library Services

Extension from precoloured sets of edges

Edwards, Katherine, Girão, António, van den Heuvel, Jan ORCID: 0000-0003-0897-9148, Kang, Ross J., Puleo, Gregory J. and Sereni, Jean-Sébastien (2018) Extension from precoloured sets of edges. Electronic Journal of Combinatorics, 25 (3). P3.1. ISSN 1077-8926

Text - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (496kB) | Preview


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.

Item Type: Article
Official URL:
Additional Information: © 2018 The Authors © CC BY-ND 4.0
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 04 Sep 2018 08:34
Last Modified: 20 Oct 2021 01:29

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics