Equivalence between pathbreadth and strong pathbreadth

Guillaume Ducoffe, Arne Leitert

We say that a given graph $G=(V,E)$ has \emph{pathbreadth} at most $\rho$, denoted $\pb(G) \leq ρ$, if there exists a Roberston and Seymour's path decomposition where every bag is…