Almost all cop-win graphs contain a universal vertex (Q418869): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.02.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079449107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418339 / 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: Q3558603 / 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: Characterizations of \(k\)-copwin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445040 / 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
Property / cites work
 
Property / cites work: Chasing robbers on random graphs: Zigzag theorem / rank
 
Normal rank

Latest revision as of 06:25, 5 July 2024

scientific article
Language Label Description Also known as
English
Almost all cop-win graphs contain a universal vertex
scientific article

    Statements

    Almost all cop-win graphs contain a universal vertex (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    cop-win graph
    0 references
    random graphs
    0 references
    universal vertex
    0 references
    cop-win ordering
    0 references

    Identifiers