Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187)

The authors consider total colourings of graphs. The list edge chromatic number of a graph \(G\) is denoted by \(\chi_l'(G)\) and the list total chromatic number is denoted by \(\chi^{\prime\prime}_l(G)\). The main results of the present paper are the following theorems: Theorem 1: Suppose that \(G\) is a planar graph with no triangle sharing an edge with a 4-cycle. \newline If \(\Delta(G)\geq 8\), then \(\chi_l'(G)=\Delta(G)\) and \(\chi^{\prime\prime}_l(G)=\Delta(G)+ 1\). Theorem 2: Suppose that \(G\) is a planar graph with no triangle sharing an edge with a 4-cycle. \newline If \(\Delta(G)\geq 6\), then \(\chi^{\prime\prime}_l(G)\leq\Delta(G)+ 2\).