Graphs of bounded VC-dimension have sub-linear twin-width, shown via a new contraction tool on neighborhood partitions, plus tighter bounds for interval graphs.
14 Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, and Stéphan Thomassé
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.
citing papers explorer
-
The Twin-Width of Graphs of Bounded VC-Dimension
Graphs of bounded VC-dimension have sub-linear twin-width, shown via a new contraction tool on neighborhood partitions, plus tighter bounds for interval graphs.
-
Computing Twin-Width via Treedepth and Vertex Integrity
Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.