A randomized algorithm for \(k\)-colorability (Q1331989)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A randomized algorithm for \(k\)-colorability |
scientific article; zbMATH DE number 626327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized algorithm for \(k\)-colorability |
scientific article; zbMATH DE number 626327 |
Statements
A randomized algorithm for \(k\)-colorability (English)
0 references
26 January 1995
0 references
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\).
0 references
randomized algorithm
0 references
colouring
0 references
critical regions
0 references
