Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Recognising the overlap graphs of subtrees of restricted trees is hard   The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs
classes with set representation characterisations. The complexity of
recognising SOGs in open. The complexities of recognising many subclasses of
SOGs are known. We consider several subclasses of SOGs by restricting the
underlying tree. For a fixed integer $k \geq 3$, we consider:
\begin{my_itemize}
  \item The overlap graphs of subtrees in a tree where that tree has $k$ leaves
  \item The overlap graphs of subtrees in trees that can be derived from a
given input tree by subdivision and have at least 3 leaves
  \item The overlap and intersection graphs of paths in a tree where that tree
has maximum degree $k$ \end{my_itemize}
  We show that the recognition problems of these classes are NP-complete. For
all other parameters we get circle graphs, well known to be polynomially
recognizable.

37
The categories of this paper are: supr-con
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
3
The categories of this paper are: physics
30
The categories of this paper are: q-alg
34
The categories of this paper are: chem-ph
10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex
16
The categories of this paper are: stat
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org