test-set | instances | vertices | edges | colours | vars | clauses
flat30-60 | 100 | 30 | 60 | 3 | 90 | 300
| flat50-115 | 1000 | 50 | 115 | 3 | 150 | 545
| flat75-180 | 100 | 75 | 180 | 3 | 225 | 840
| flat100-239 | 100 | 100 | 239 | 3 | 300 | 1117
| flat125-301 | 100 | 125 | 301 | 3 | 375 | 1403
| flat150-360 | 100 | 150 | 360 | 3 | 450 | 1680
| flat175-417 | 100 | 175 | 417 | 3 | 525 | 1951
| flat200-479 | 100 | 200 | 479 | 3 | 600 | 2237
| |
Table 1: SAT-encoded Graph Colouring test-sets (flat random graphs). All instances are satisfiable.
[Hogg96]
Tad Hogg
Refining the Phase Transition in Combinatorial Search.
Artificial Inteligence, Vol. 81, pages 127-154, 1996 | |
[Hog96]
Tad Hogg
Refining the Phase Transition in Combinatorial Search.
Artificial Inteligence, Vol. 81, pages 127-154, 1996 | |