[کتاب][B] The game of cops and robbers on graphs

A Bonato - 2011‏ - books.google.com
This book is the first and only one of its kind on the topic of Cops and Robbers games, and
more generally, on the field of vertex pursuit games on graphs. The book is written in a lively …

Flip-width: Cops and robber on dense graphs

S Toruńczyk - 2023 IEEE 64th Annual Symposium on …, 2023‏ - ieeexplore.ieee.org
We define new graph parameters, called flip-width, that generalize treewidth, degeneracy,
and generalized coloring numbers for sparse graphs, and clique-width and twin-width for …

[کتاب][B] Inverse problems and zero forcing for graphs

L Hogben, JCH Lin, BL Shader - 2022‏ - books.google.com
This book provides an introduction to the inverse eigenvalue problem for graphs (IEP-$ G $)
and the related area of zero forcing, propagation, and throttling. The IEP-$ G $ grew from the …

[کتاب][B] An invitation to pursuit-evasion games and graph theory

A Bonato - 2022‏ - books.google.com
Graphs measure interactions between objects such as friendship links on Twitter,
transactions between Bitcoin users, and the flow of energy in a food chain. While graphs …

Variations on cops and robbers

A Frieze, M Krivelevich, PS Loh - Journal of Graph Theory, 2012‏ - Wiley Online Library
We consider several variants of the classical Cops and Robbers game. We treat the version
where the robber can move R≥ 1 edges at a time, establishing a general upper bound of …

[HTML][HTML] Cops and robbers is exptime-complete

WB Kinnersley - Journal of Combinatorial Theory, Series B, 2015‏ - Elsevier
Cops and Robbers is EXPTIME-complete - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Help Search My account Sign in View PDF Download full issue …

Cops and robbers from a distance

A Bonato, E Chiniforooshan, P Prałat - Theoretical Computer Science, 2010‏ - Elsevier
Cops and Robbers is a pursuit and evasion game played on graphs that has received much
attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers …

Combinatorial games: selected bibliography with a succinct gourmet introduction

A Fraenkel - The Electronic Journal of Combinatorics, 2012‏ - combinatorics.org
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …

Cops and invisible robbers: The cost of drunkenness

A Kehagias, D Mitsche, P Prałat - Theoretical Computer Science, 2013‏ - Elsevier
We examine a version of the cops and robbers (CR) game in which the robber is invisible,
ie, the cops do not know his location until they capture him. Apparently this game (CiR) has …

-Metric Graphs: Hyperbolicity

FF Dragan, G Ducoffe - arxiv preprint arxiv:2404.14792, 2024‏ - arxiv.org
A graph is called $\alpha_i $-metric ($ i\in {\cal N} $) if it satisfies the following $\alpha_i $-
metric property for every vertices $ u, w, v $ and $ x $: if a shortest path between $ u $ and …