Adaptable and conflict colouring multigraphs with no cycles of length three or four

Jurgen Aliaj, Michael Molloy

The adaptable choosability of a multigraph $G$, denoted ${\mathrm{ch}}_a(G)$, is the smallest integer $k$ such that any edge labelling, $\tau$, of $G$ and any assignment of lists of siz…