Adaptable and conflict colouring multigraphs with no cycles of length three or four
Adaptable and conflict colouring multigraphs with no cycles of length three or four
Abstract The adaptable choosability of a multigraph , denoted , is the smallest integer such that any edge labelling, , of and any assignment of lists of size to the vertices of permits a list colouring, , of such that there is no edge where . Here we show that …