The complexity of choosing an <i>H</i> -colouring (nearly) uniformly at random (Q3579223)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of choosing an <i>H</i> -colouring (nearly) uniformly at random |
scientific article |
Statements
The complexity of choosing an <i>H</i> -colouring (nearly) uniformly at random (English)
0 references
5 August 2010
0 references
