Few Long Lists for Edge Choosability of Planar Cubic Graphs

Luis Goddyn, Andrea Spencer

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…