The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic (Q5696396)
From MaRDI portal
scientific article; zbMATH DE number 2215611
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic |
scientific article; zbMATH DE number 2215611 |
Statements
The dynamics of proving uncolourability of large random graphs: I. Symmetric colouring heuristic (English)
0 references
18 October 2005
0 references
backtracking produce
0 references
uncolourability
0 references
surface growth
0 references
