One-visibility cops and robber on trees: optimal cop-win strategies (Q2079862): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited visibility cops and robber / 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: The complexity of zero-visibility cops and robber / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing width in linear layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / 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: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partition approach to lower bounds for zero-visibility cops and robber / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-visibility cops and robber on trees / rank
 
Normal rank

Latest revision as of 08:36, 30 July 2024

scientific article
Language Label Description Also known as
English
One-visibility cops and robber on trees: optimal cop-win strategies
scientific article

    Statements