Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (Q468433): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2014.08.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2014.08.023 / rank | |||
Normal rank | |||
Latest revision as of 18:27, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) |
scientific article |
Statements
Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (English)
0 references
7 November 2014
0 references
\(k\)-cop-win graph
0 references
random graphs
0 references
