Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Cliques in Odd-Minor-Free Graphs   This paper is about: (1) bounds on the number of cliques in a graph in a
particular class, and (2) algorithms for listing all cliques in a graph. We
present a simple algorithm that lists all cliques in an $n$-vertex graph in
O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a
fixed minor, we describe a O(n) time algorithm for listing all cliques. We
prove that graphs excluding a fixed odd-minor have $O(n^2)$ cliques (which is
tight), and conclude a $O(n^3)$ time algorithm for listing all cliques.

10
The categories of this paper are: q-bio
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th
36
The categories of this paper are: cmp-lg
35
The categories of this paper are: mtrl-th
32
The categories of this paper are: atom-ph
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
27
The categories of this paper are: comp-gas
26
The categories of this paper are: bayes-an
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg