Almost all k-cop-win graphs contain a dominating set of cardinality k

Pawel Pralat. Almost all k-cop-win graphs contain a dominating set of cardinality k. Discrete Mathematics, 338:47-52, 2015. [doi]

Authors

Pawel Pralat

This author has not been identified. Look up 'Pawel Pralat' in Google