{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:58Z","timestamp":1759335658684,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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$. 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.<\/jats:p>","DOI":"10.37236\/6303","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:20:25Z","timestamp":1578669625000},"source":"Crossref","is-referenced-by-count":9,"title":["Extension from Precoloured Sets of Edges"],"prefix":"10.37236","volume":"25","author":[{"given":"Katherine","family":"Edwards","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio","family":"Gir\u00e3o","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Van den Heuvel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4219-593X","authenticated-orcid":false,"given":"Ross J.","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Gregory J.","family":"Puleo","sequence":"additional","affiliation":[]},{"given":"Jean-S\u00e9bastien","family":"Sereni","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,7,13]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p1\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p1\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:30:52Z","timestamp":1579235452000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i3p1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,13]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,7,12]]}},"URL":"https:\/\/doi.org\/10.37236\/6303","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,7,13]]},"article-number":"P3.1"}}