Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Detecting and Enumerating Small Induced Subgraphs in $c$-Closed Graphs   Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called
$c$-closure, for a parameterized study of clique enumeration problems. A graph
$G$ is $c$-closed if every pair of vertices with at least $c$ common neighbors
is adjacent. The $c$-closure of $G$ is the smallest $c$ such that $G$ is
$c$-closed. We systematically explore the impact of $c$-closure on the
computational complexity of detecting and enumerating small induced subgraphs.
More precisely, for each graph $H$ on three or four vertices, we investigate
parameterized polynomial-time algorithms for detecting $H$ and for enumerating
all occurrences of $H$ in a given $c$-closed graph.

33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
25
The categories of this paper are: patt-sol
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
13
The categories of this paper are: quant-ph
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
20
The categories of this paper are: acc-phys
26
The categories of this paper are: bayes-an
14
The categories of this paper are: math-ph
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga