Packing list-colourings

10/11/2021
by   Stijn Cambie, et al.
0

List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a potentially rich seam of interesting problems spanning chromatic graph theory. Given a k-list-assignment L of a graph G, which is the assignment of a list L(v) of k colours to each vertex v∈ V(G), we study the existence of k pairwise-disjoint proper colourings of G using colours from these lists. We may refer to this as a list-packing. Using a mix of combinatorial and probabilistic methods, we set out some basic upper bounds on the smallest k for which such a list-packing is always guaranteed, in terms of the number of vertices, the degeneracy, the maximum degree, or the (list) chromatic number of G. (The reader might already find it interesting that such a minimal k is well defined.) We also pursue a more focused study of the case when G is a bipartite graph. Our results do not yet rule out the tantalising prospect that the minimal k above is not too much larger than the list chromatic number. Our study has taken inspiration from study of the strong chromatic number, and we also explore generalisations of the problem above in the same spirit.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2022

On List Coloring with Separation of the Complete Graph and Set System Intersections

We consider the following list coloring with separation problem: Given a...
research
11/24/2019

List colouring of two matroids through reduction to partition matroids

In the list colouring problem for two matroids, we are given matroids M_...
research
04/17/2022

Optimally Reconfiguring List and Correspondence Colourings

The reconfiguration graph 𝒞_k(G) for the k-colourings of a graph G has a...
research
06/20/2022

List Colouring Trees in Logarithmic Space

We show that List Colouring can be solved on n-vertex trees by a determi...
research
07/29/2021

A tight lower bound for the online bounded space hypercube bin packing problem

In the d-dimensional hypercube bin packing problem, a given list of d-di...
research
02/15/2018

List Heaps

This paper presents a simple extension of the binary heap, the List Heap...
research
07/09/2021

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

The adaptable choosability of a multigraph G, denoted ch_a(G), is the sm...

Please sign up or login with your details

Forgot password? Click here to reset