List edge-colorings of series-parallel graphs (Q1808155): Difference between revisions

Extended abstract: It is proved that for every integer \(k\geq 3\), for every (simple) series-parallel graph \(G\) with maximum degree at most \(k\), and for every collection \((L(e):e\in E(G))\) of sets, each of size at least \(k\), there exists a proper edge-coloring of \(G\) such that for every edge \(e\in E(G)\), the color of \(e\) belongs to \(L(e)\). A linear-time algorithm is also presented.