Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Confining the Robber on Cographs   In this paper, the notions of {\em trapping} and {\em confining} the robber
on a graph are introduced. We present some structural necessary conditions for
graphs $G$ not containing the path on $k$ vertices (referred to as $P_k$-free
graphs) for some $k\ge 4$, so that $k-3$ cops do not have a strategy to capture
or confine the robber on $G$. Utilizing such conditions, we show that for
planar cographs and planar $P_5$-free graphs the confining cop number is at
most one and two, respectively. It is also shown that the number of vertices of
a connected cograph on which one cop does not have a strategy to confine the
robber has a tight lower-bound of eight. We also explore the effects of twin
operations -- which are well known to provide a characterization of cographs --
on the number of cops required to capture or confine the robber on cographs. We
conclude by posing two conjectures concerning the confining cop number of
$P_5$-free graphs and the smallest planar graph of confining cop number of
three.

4
The categories of this paper are: cond-mat
36
The categories of this paper are: cmp-lg
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
37
The categories of this paper are: supr-con
27
The categories of this paper are: comp-gas