Total 4-choosability of series-parallel graphs (Q870016)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Total 4-choosability of series-parallel graphs |
scientific article |
Statements
Total 4-choosability of series-parallel graphs (English)
0 references
12 March 2007
0 references
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.
0 references