Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Finding Efficient Domination for $S_{1,3,3}$-Free Bipartite Graphs in
  Polynomial Time   A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient
dominating set} (\emph{e.d.s.}\ for short) of $G$ if every vertex of $G$ is
dominated by exactly one vertex of $D$. The \emph{Efficient Domination} (ED)
problem, which asks for the existence of an e.d.s.\ in $G$, is \NP-complete for
various $H$-free bipartite graphs, e.g., Lu and Tang showed that ED is
\NP-complete for chordal bipartite graphs and for planar bipartite graphs;
actually, ED is \NP-complete even for planar bipartite graphs with vertex
degree at most 3 and girth at least $g$ for every fixed $g$. Thus, ED is
\NP-complete for $K_{1,4}$-free bipartite graphs and for $C_4$-free bipartite
graphs.
  In this paper, we show that ED can be solved in polynomial time for
$S_{1,3,3}$-free bipartite graphs.

3
The categories of this paper are: physics
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
37
The categories of this paper are: supr-con