Zero-visibility cops and robber and the pathwidth of a graph (Q2343977): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-014-9712-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2143633463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Pursuit-Evasion in Graphs / 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: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of \(k\)-copwin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the cops and robber game on graphs embedded in non-orientable surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Pathwidth to Connected Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / 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: Randomized Pursuit-Evasion with Local Visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role of information in the cop-robber game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sweeping graphs with large clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cops and Robber game on graphs with forbidden (induced) subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on cops and drunk robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and invisible robbers: the cost of drunkenness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recontamination does not help to search 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: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong-mixed searching and pathwidth / rank
 
Normal rank

Latest revision as of 02:21, 10 July 2024

scientific article
Language Label Description Also known as
English
Zero-visibility cops and robber and the pathwidth of a graph
scientific article

    Statements

    Zero-visibility cops and robber and the pathwidth of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2015
    0 references
    cops and robber
    0 references
    graph searching
    0 references
    pathwidth
    0 references
    pursuit evasion
    0 references

    Identifiers