Extension from Precoloured Sets of Edges

Abstract : 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.
Document type :
Reports
Complete list of metadatas

Cited literature [36 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01024843
Contributor : Jean-Sébastien Sereni <>
Submitted on : Thursday, July 28, 2016 - 12:22:05 PM
Last modification on : Thursday, August 1, 2019 - 2:13:44 PM
Long-term archiving on : Saturday, October 29, 2016 - 10:59:33 AM

File

edgeprecolour.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01024843, version 2

Collections

Citation

Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, et al.. Extension from Precoloured Sets of Edges. [Research Report] Loria & Inria Grand Est. 2016. ⟨hal-01024843v2⟩

Share

Metrics

Record views

196

Files downloads

78