The Cops and Robber game on graphs with forbidden (induced) subgraphs

Details The Cops and Robber game on graphs with forbidden (induced) subgraphs The Cops and Robber game on graphs with forbidden (induced) subgraphs

2008-04-25

arxiv.org/abs/0804.4145v2

Contributions to Discrete Mathematics, vol. 5/2, pp. 40--51, 2010

Mathematics

Combinatorics

Scientific paper

The two-player, complete information game of Cops and Robber is played on undirected finite graphs. A number of cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if, after a move, a cop and the robber are on the same vertex. The minimum number of cops needed to catch the robber on a graph is called the cop number of that graph. In this paper, we study the cop number in the classes of graphs defined by forbidding one or more graphs as either subgraphs or induced subgraphs. In the case of a single forbidden graph we completely characterize (for both relations) the graphs which force bounded cop number. En passant, we bound the cop number in terms of tree-width.

Affiliated with

Also associated with

No associations

Rating

The Cops and Robber game on graphs with forbidden (induced) subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Cops and Robber game on graphs with forbidden (induced) subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Cops and Robber game on graphs with forbidden (induced) subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728194