Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Finding a sun in building-free graphs   Deciding whether an arbitrary graph contains a sun was recently shown to be
NP-complete. We show that whether a building-free graph contains a sun can be
decided in O(min$\{m{n^3}, m^{1.5}n^2\}$) time and, if a sun exists, it can be
found in the same time bound. The class of building-free graphs contains many
interesting classes of perfect graphs such as Meyniel graphs which, in turn,
contains classes such as hhd-free graphs, i-triangulated graphs, and parity
graphs. Moreover, there are imperfect graphs that are building-free. The class
of building-free graphs generalizes several classes of graphs for which an
efficient test for the presence of a sun is known. We also present a vertex
elimination scheme for the class of (building, gem)-free graphs. The class of
(building, gem)-free graphs is a generalization of the class of distance
hereditary graphs and a restriction of the class of (building, sun)-free
graphs.

34
The categories of this paper are: chem-ph
32
The categories of this paper are: atom-ph
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex
20
The categories of this paper are: acc-phys
10
The categories of this paper are: q-bio
18
The categories of this paper are: econ
19
The categories of this paper are: eess
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
35
The categories of this paper are: mtrl-th