antiquated
发表于 2025-4-1 03:22:30
The Robber Strikes Backtex containing a single cop, then that cop is removed from the game. We study the minimum number of cops needed to capture a robber on a graph ., written cc(.). We give bounds on cc(.) in terms of the cop number of . in the classes of bipartite graphs and diameter two, ..,.-free graphs.