Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Transversals of Longest Paths and Cycles   Let G be a graph of order n. Let lpt(G) be the minimum cardinality of a set X
of vertices of G such that X intersects every longest path of G and define
lct(G) analogously for cycles instead of paths. We prove that lpt(G) \leq
ceiling(n/4-n^{2/3}/90), if G is connected, lct(G) \leq
ceiling(n/3-n^{2/3}/36), if G is 2-connected, and \lpt(G) \leq 3, if G is a
connected circular arc graph. Our bound on lct(G) improves an earlier result of
Thomassen and our bound for circular arc graphs relates to an earlier statement
of Balister \emph{et al.} the argument of which contains a gap. Furthermore, we
prove upper bounds on lpt(G) for planar graphs and graphs of bounded
tree-width.

5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
24
The categories of this paper are: dg-ga
20
The categories of this paper are: acc-phys
4
The categories of this paper are: cond-mat
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
11
The categories of this paper are: hep-lat
31
The categories of this paper are: ao-sci
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
16
The categories of this paper are: stat
19
The categories of this paper are: eess