We introduce graph width parameters, called α-edge-crossing width and
ed...
Let ℱ be a family of graphs, and let p,r be nonnegative
integers. The (p...
In a reduction sequence of a graph, vertices are successively identified...
Algorithms for computing or approximating optimal decompositions for
dec...
We prove that there exists a function f(k)=𝒪(k^2 log k) such
that for ev...
An intersection digraph is a digraph where every vertex v is represented...
The canonical tree-decomposition theorem, given by Robertson and Seymour...
Tree-width and its linear variant path-width play a central role for the...
The Cut Count technique and the rank-based approach have lead to
sin...
We introduce a new subclass of chordal graphs that generalizes split gra...
A graph G is an ℓ-leaf power of a tree T if V(G) is equal to the
set of ...
Shrub-depth and rank-depth are dense analogues of the tree-depth of a gr...
We develop a framework for applying treewidth-based dynamic programming ...
A class G of graphs is χ-bounded if there is a function f
such that for...
The notion of tree-cut width has been introduced by Wollan [The structur...
A graph class F has the induced Erdős-Pósa property if
there exists a fu...
We generalise the family of (σ, ρ)-problems and locally checkable
vertex...
We complement the recent algorithmic result that Feedback Vertex Set is
...
A chordless cycle in a graph G is an induced subgraph of G which is a
cy...