Total 4-choosability of series-parallel graphs (Q870016): Difference between revisions

Summary: It is proved that, if \(G\) is a \(K_4\)-minor-free graph with maximum degree 3, then \(G\) is totally 4-choosable; that is, if every element (vertex or edge) of \(G\) is assigned a list of 4 colours, then every element can be coloured with a colour from its own list in such a way that every two adjacent or incident elements are coloured with different colours. Together with other known results, this shows that the list-total-colouring conjecture, that ch\(''(G) = \chi''(G)\) for every graph \(G\), is true for all \(K_4\)-minor-free graphs and, therefore, for all outerplanar graphs.