Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (Q468433): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all cop-win graphs contain a universal vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pursuit-Evasion in Models of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of \(k\)-copwin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chasing robbers on random graphs: Zigzag theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meyniel's conjecture holds for random graphs / rank
 
Normal rank

Revision as of 06:00, 9 July 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
    0 references
    7 November 2014
    0 references
    \(k\)-cop-win graph
    0 references
    random graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references