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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.