Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Simple Recognition of Halin Graphs and Their Generalizations   We describe and implement two local reduction rules that can be used to
recognize Halin graphs in linear time, avoiding the complicated planarity
testing step of previous linear time Halin graph recognition algorithms. The
same two rules can be used as the basis for linear-time algorithms for other
algorithmic problems on Halin graphs, including decomposing these graphs into a
tree and a cycle, finding a Hamiltonian cycle, or constructing a planar
embedding. These reduction rules can also be used to recognize a broader class
of polyhedral graphs. These graphs, which we call the D3-reducible graphs, are
the dual graphs of the polyhedra formed by gluing pyramids together on their
triangular faces; their treewidth is bounded, and they necessarily have
Lombardi drawings.

10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
6
The categories of this paper are: astro-ph
31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org