Leslie Ann Goldberg, Steven Kelk, Mike Paterson. The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. SIAM Journal on Computing, 33(2):416-432, 2004. [doi]
@article{GoldbergKP04,
title = {The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random},
author = {Leslie Ann Goldberg and Steven Kelk and Mike Paterson},
year = {2004},
doi = {10.1137/S0097539702408363},
url = {http://dx.doi.org/10.1137/S0097539702408363},
researchr = {https://researchr.org/publication/GoldbergKP04},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {33},
number = {2},
pages = {416-432},
}