Choosability, edge choosability and total choosability of outerplane graphs (Q1840829)

If each vertex \(v\) of a graph \(G\) is assigned a list \(L(v)\) of possible colors and \(G\) has a proper coloring \(\sigma\) such that \(\sigma(v)\in L(v)\) for all \(v\), then we say that \(G\) is \(L\)-colorable. If \(|L(v)|= k\) for all \(v\) and if \(G\) is \(L\)-colorable for each such \(L\), then \(G\) is said to be \(k\)-choosable. By considering colorings for \(E(G)\) and for \(E(G)\cup V(G)\) we can define parallel notions such as edge choosability and total choosability. Several relations for these quantities and, in particular, the list edge coloring conjecture for outerplane graphs are proved.