Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth

Publication

Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth

Adler, Isolde; Fluck, Eva (2026): Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth, in: Bamberg: Otto-Friedrich-Universität, S. 1–18.

Details

Faculty/Chair
Faculty/Professorship
Author
Fluck, Eva
Publisher Information
Otto-Friedrich-Universität : Bamberg
Year of publication
2026
Source/Other editions
Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth, Ithaca, NY: arXiv, 2024, S. 1–18, DOI: 10.48550/arXiv.2402.09139.
Year of first publication
2024
Language
English
Licence
URN
Abstract

We study a variation of the cops and robber game characterising treewidth, where in each play at most q cops can be placed in order to catch the robber, where q is a parameter of the game. We prove that if k cops have a winning strategy in this game, then k cops have a monotone winning strategy. As a corollary we obtain a new characterisation of bounded depth treewidth, and we give a positive answer to an open question by Fluck, Seppelt and Spitzer (2024), thus showing that graph classes of bounded depth treewidth are homomorphism distinguishing closed. Our proof of monotonicity substantially reorganises a winning strategy by first transforming it into a pre-decomposition, which is inspired by decompositions of matroids, and then applying an intricate breadth-first ‘cleaning up’ procedure along the pre-decomposition (which may temporarily lose the property of representing a strategy), in order to achieve monotonicity while controlling the number of cop placements simultaneously across all branches of the decomposition via a vertex exchange argument. We believe this can be useful in future research.

Keywords
tree decompositions
treewidth
treedepth
cops-and-robber game
monotonicity
homomorphism distinguishing closure
Type
Conferenceobject
URI
Activation date
2026-05-22

Permalink: https://fis.uni-bamberg.de/handle/uniba/115222 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-15

Restricted read-only access: login, editing and submission are temporarily disabled.