A randomized algorithm for \(k\)-colorability
The author tests a straightforward generalization of \textit{A. D. Petford} and \textit{D. J. A. Welsh} [A randomized 3-colouring algorithm, Discrete Math. 74, No. 1/2, 253-261 (1989; Zbl 0667.05025)] on randomly generated samples of 4- and 10-colourable graphs, and he conjectures that the curious critical regions found in the case of 3-colourings are a general phenomena for all \(k\).
scientific article; zbMATH DE number 626327