Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Above guarantee parameterization for vertex cover on graphs with maximum
  degree 4   In the vertex cover problem, the input is a graph $G$ and an integer $k$, and
the goal is to decide whether there is a set of vertices $S$ of size at most
$k$ such that every edge of $G$ is incident on at least one vertex in $S$. We
study the vertex cover problem on graphs with maximum degree 4 and minimum
degree at least 2, parameterized by $r = k-n/3$. We give an algorithm for this
problem whose running time is $O^*(1.6253^r)$. As a corollary, we obtain an
$O^*(1.2403^k)$-time algorithm for vertex cover on graphs with maximum degree
4.

24
The categories of this paper are: dg-ga
6
The categories of this paper are: astro-ph
22
The categories of this paper are: chao-dyn
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
5
The categories of this paper are: gr-qc
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
2
The categories of this paper are: math
19
The categories of this paper are: eess
23
The categories of this paper are: solv-int
36
The categories of this paper are: cmp-lg
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
3
The categories of this paper are: physics