Planar graphs with $\Delta \ge 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable

Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou

For planar graphs, we consider the problems of \emph{list edge coloring} and \emph{list total coloring}. Edge coloring is the problem of coloring the edges while ensuring that two…