Author

Kevin Hendrey

h-index 9 View on Semantic Scholar

We have 1 of 48 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Optimal tree-decompositions with bags of bounded pathwidth

We show that every planar graph has a tree-decomposition with optimal width such that the subgraph induced by each bag has pathwidth at most 3. This bound is best possible, and for tree-decompositions that satisfy a certain minimality condition, we in fact give a precise description of the possible structures in each b...

Kevin Hendrey, Robert Hickingbotham, Jędrzej Hodor et al. · arXiv.org · 0 citations