English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We say that a given graph $G = (V, E)$ has \emph{pathbreadth} at most $\rho$,denoted $\pb(G) \leq \rho$, if there exists a Roberston and Seymour's pathdecomposition where every bag is contained in the $\rho$-neighbourhood of somevertex. Similarly, we say that $G$ has \emph{strong pathbreadth} at most$\rho$, denoted $\spb(G) \leq \rho$, if there exists a Roberston and Seymour'spath decomposition where every bag is the complete $\rho$-neighbourhood of somevertex. It is straightforward that $\pb(G) \leq \spb(G)$ for any graph $G$.Inspired from a close conjecture in [Leitert and Dragan, COCOA'16], we prove inthis note that $\spb(G) \leq 4 \cdot \pb(G)$.

Equivalence between pathbreadth and strong pathbreadth