Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Colourings with Bounded Monochromatic Components in Graphs of Given
  Circumference   We prove that every graph with circumference at most $k$ is $O(\log
k)$-colourable such that every monochromatic component has size at most $O(k)$.
The $O(\log k)$ bound on the number of colours is best possible, even in the
setting of colourings with bounded monochromatic degree.

12
The categories of this paper are: nucl-th
25
The categories of this paper are: patt-sol
1
The categories of this paper are: cs
4
The categories of this paper are: cond-mat
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
3
The categories of this paper are: physics
22
The categories of this paper are: chao-dyn
32
The categories of this paper are: atom-ph
8
The categories of this paper are: hep-ex
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga