Connected search for a lazy robber
From MaRDI portal
Publication:6080862
DOI10.1002/jgt.22669zbMath1522.05300OpenAlexW3152033596MaRDI QIDQ6080862
Dimitrios M. Thilikos, Isolde Adler, Christophe Paul
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22669
graph searchingprice of connectivityconnected treewidthcontraction obstructionsCops and Robbers game
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contraction obstructions for connected graph searching
- Contracting planar graphs to contractions of triangulations
- Connected graph searching
- Graph minors. XX: Wagner's conjecture
- Connected tree-width
- Forbidden minors characterization of partial 3-trees
- An annotated bibliography on guaranteed graph searching
- Connected graph searching in chordal graphs
- Monotony properties of connected visible graph searching
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Nondeterministic graph searching: from pathwidth to treewidth
- Sweeping graphs with large clique number
- Interval graphs and searching
- Quickly excluding a forest
- The vertex separation number of a graph equals its path-width
- Upper bounds on the size of obstructions and intertwines
- A partial k-arboretum of graphs with bounded treewidth
- Graph searching and a min-max theorem for tree-width
- Obstruction set isolation for the gate matrix layout problem
- Fugitive-search games on graphs and related parameters
- On the monotonicity of games generated by symmetric submodular functions.
- The theory of search games and rendezvous.
- Searching and pebbling
- Bucket elimination: A unifying framework for reasoning
- A primer for undergraduate research. From groups and tiles to frames and vaccines
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Connected Graph Searching in Outerplanar Graphs
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Connected Treewidth and Connected Graph Searching
- Monotonicity in graph searching
- On Linear Recognition of Tree-Width at Most Four
- From Pathwidth to Connected Pathwidth
- Graph Searching in a Crime Wave
- Recontamination does not help to search a graph
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Bounding Connected Tree-Width
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Connected search for a lazy robber
