![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)
We prove a general duality theorem for width parameters in combinatorial structures such as graphs and matroids. It implies the classical such theorems for path-width, tree-width, branch-width and rank-width, ...
-
Chapter and Conference Paper
An FPT 2-Approximation for Tree-cut Decomposition
The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47–66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequa...
-
Article
An FPT 2-Approximation for Tree-Cut Decomposition
The tree-cut width of a graph is a graph parameter defined by Wollan (J Combin Theory, Ser B, 110:47–66, 2015) with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequat...
-
Article
A Polynomial Kernel for 3-Leaf Power Deletion
For a non-negative integer \(\ell \) ℓ , the