Pawel Pralat. Almost all k-cop-win graphs contain a dominating set of cardinality k. Discrete Mathematics, 338:47-52, 2015. [doi]
@article{Pralat15,
title = {Almost all k-cop-win graphs contain a dominating set of cardinality k},
author = {Pawel Pralat},
year = {2015},
doi = {10.1016/j.disc.2014.08.023},
url = {http://dx.doi.org/10.1016/j.disc.2014.08.023},
researchr = {https://researchr.org/publication/Pralat15},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {338},
pages = {47-52},
}