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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The $r$-flip-width of a graph, for $r\in \mathbb{N}\cup \{\infty\}$, is agraph parameter defined in terms of a variant of the cops and robber game,called a flipper game, and it was introduced by Toru\'{n}czyk [Flip-width: Copsand robber on dense graphs, arXiv:2302.00352]. We prove that for every $r\in(\mathbb{N}\setminus \{1\})\cup \{\infty\}$, the class of graphs of$r$-flip-width at most $2$ is exactly the class of ($C_5$, bull, gem,co-gem)-free graphs, which are known as totally decomposable graphs withrespect to bi-joins.

A characterization of graphs of radius-$r$ flip-width at most $2$