Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Separating layered treewidth and row treewidth   Layered treewidth and row treewidth are recently introduced graph parameters
that have been key ingredients in the solution of several well-known open
problems. It follows from the definitions that the layered treewidth of a graph
is at most its row treewidth plus 1. Moreover, a minor-closed class has bounded
layered treewidth if and only if it has bounded row treewidth. However, it has
been open whether row treewidth is bounded by a function of layered treewidth.
This paper answers this question in the negative. In particular, for every
integer $k$ we describe a graph with layered treewidth 1 and row treewidth $k$.
We also prove an analogous result for layered pathwidth and row pathwidth.

28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
26
The categories of this paper are: bayes-an
25
The categories of this paper are: patt-sol
16
The categories of this paper are: stat