Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
From MaRDI portal
Publication:6428294
arXiv2303.01944MaRDI QIDQ6428294FDOQ6428294
Authors: Stijn Cambie 
Publication date: 3 March 2023
Abstract: 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 partition into disjoint colourings, we speak of a packing. However, even for complete bipartite graphs, the list chromatic number can be arbitrarily large, and its exact determination is generally difficult. For the packing variant, this question becomes even harder. In this paper, we study the correspondence- and list packing numbers of (asymmetric) complete bipartite graphs. In the most asymmetric cases, Latin squares come into play. Our results show that every can be equal to the correspondence packing number of a graph. Additionally, we disprove a recent conjecture that relates the list packing number and the list flexibility number.
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428294)
