Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing

Stijn Cambie, Rimma Hämäläinen

Applications of graph colouring often involve taking restrictions into account, and it is desirable to have multiple (disjoint) solutions. In the optimal case, where there is a par…