
The size Ramsey number of graphs with bounded treewidth
A graph G is Ramsey for a graph H if every 2colouring of the edges of G...
read it

Two Results on Layered Pathwidth and Linear Layouts
Layered pathwidth is a new graph parameter studied by Bannister et al (2...
read it

Four short stories on surprising algorithmic uses of treewidth
This article briefly describes four algorithmic problems where the notio...
read it

Error Floor Analysis of LDPC Row Layered Decoders
In this paper, we analyze the error floor of quasicyclic (QC) lowdensi...
read it

Regular resolution for CNF of bounded incidence treewidth with few long clauses
We demonstrate that Regular Resolution is FPT for two restricted familie...
read it

Limits of Treewidthbased tractability in Optimization
Sparse structures are frequently sought when pursuing tractability in op...
read it

An Effective Upperbound on Treewidth Using Partial Fillin of Separators
Partitioning a graph using graph separators, and particularly clique sep...
read it
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 wellknown open problems. It follows from the definitions that the layered treewidth of a graph is at most its row treewidth plus 1. Moreover, a minorclosed 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.
READ FULL TEXT
Comments
There are no comments yet.