Throttling for the game of cops and robbers on graphs (Q724850): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964143920 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1712.07728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing parameters and minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cop number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the burning number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capture time of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capture time of the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning a Graph as a Model of Social Contagion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game of overprescribed Cops and Robbers played on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted power domination and zero forcing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Throttling for the game of cops and robbers on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Throttling positive semidefinite zero forcing propagation time on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers in graphs with large girth and Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cop-win graphs with maximum capture-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(k\)-cop, \(l\)-robber games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation time for zero forcing on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and Robbers on Planar‐Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capture time of grids / 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: On the Capture Time of Cops and Robbers Game on a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite propagation time / rank
 
Normal rank

Latest revision as of 05:52, 16 July 2024

scientific article
Language Label Description Also known as
English
Throttling for the game of cops and robbers on graphs
scientific article

    Statements

    Throttling for the game of cops and robbers on graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    cops and robbers
    0 references
    propagation time
    0 references
    throttling
    0 references
    zero forcing
    0 references
    positive semidefinite
    0 references
    0 references
    0 references