The optimal capture time of the one-cop-moves game (Q2348264): 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.tcs.2015.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017334312 / 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: The capture time of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithms for generalized Cops and Robbers games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better bound for the cop number of general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of \(k\)-copwin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-visibility cops and robber and the pathwidth of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on cops and robbers / 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: Q5445040 / 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: Extensive Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Meyniel's conjecture of the cop number / 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: Q3565878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and composite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound for the Cops and Robbers Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 04:48, 10 July 2024

scientific article
Language Label Description Also known as
English
The optimal capture time of the one-cop-moves game
scientific article

    Statements

    Identifiers

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