Cops and Robbers on -Free Graphs
We prove that every connected-free graph has cop number at most two, solving a conjecture
of Sivaraman. In order to do so, we first prove that every connected-free graph with …
of Sivaraman. In order to do so, we first prove that every connected-free graph with …
Improved bounds on the cop number when forbidding a minor
Andreae proved that the cop number of connected HH‐minor‐free graphs is bounded for
every graph H H. In particular, the cop number is at most∣ E (H− h)∣ |E(Hh)| if H− h Hh …
every graph H H. In particular, the cop number is at most∣ E (H− h)∣ |E(Hh)| if H− h Hh …
Cops and robber on subclasses of P5-free graphs
The game of cops and robber is a turn-based vertex pursuit game played on a connected
graph between a team of cops and a single robber. The cops and the robber move …
graph between a team of cops and a single robber. The cops and the robber move …
Games, Graphs, and Groups
L Versteegen - 2024 - repository.cam.ac.uk
A linear configuration is said to be common in an Abelian group G if every 2-colouring of G
yields at least as many monochromatic instances of the configuration as a randomly chosen …
yields at least as many monochromatic instances of the configuration as a randomly chosen …
[HTML][HTML] A note on cops and robbers, independence number, domination number and diameter
A note on cops and robbers, independence number, domination number and diameter -
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …
[引用][C] Proof of a conjecture of Turcotte on domination in P5-free graphs
M Chudnovsky, S Norin, P Seymour