Few Long Lists for Edge Choosability of Planar Cubic Graphs
From MaRDI portal
Publication:6236782
arXiv1210.7944MaRDI QIDQ6236782FDOQ6236782
Authors: Luis Goddyn, Andrea Spencer 
Publication date: 30 October 2012
Abstract: It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result. Let G be a planar cubic graph having b cut-edges. There exists a set F of at most 5b/2 edges of G with the following property. For any function L which assigns to each edge of F a set of 4 colours and which assigns to each edge in E(G)-F a set of 3 colours, the graph G has a proper edge colouring where the colour of each edge e belongs to L(e).
This page was built for publication: Few Long Lists for Edge Choosability of Planar Cubic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236782)
