Multi-colouring the Mycielskian of Graphs Wensong Lin

A k-fold colouring of a graph is a function that assigns to each vertex a set of k colours, so that the colour sets assigned to adjacent vertices are disjoint. The k-th chromatic number of a graph G, denoted by χk(G), is the minimum total number of colours used in a k-fold colouring of G. Let μ(G) denote the Mycielskian of G. For any positive integer k, it… (More)