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

A graph class is said to be tame if graphs in the class have a polynomially bounded number of minimal separators. Tame graph classes have good algorithmic properties, which follow, for example, from an algorithmic metatheorem of Fomin, Todinca, and Villanger from 2015. We show that a hereditary graph class G is tame if and only if the subclass consisting of graphs in G without clique cutsets is tame. This result and Ramsey’s theorem lead to several types of sufficient conditions for a graph class to be tame. In particular, we show that any hereditary class of graphs of bounded clique cover number that excludes some complete prism is tame, where a complete prism is the Cartesian product of a complete graph with a K2. We apply these results, combined with constructions of graphs with exponentially many minimal separators, to develop a dichotomy theorem separating tame from non-tame graph classes within the family of graph classes defined by sets of forbidden induced subgraphs with at most four vertices. Mathematics Subject Classifications: 05C40, 05C75, 05C30, 05C76, 05C69

Polynomially Bounding the Number of Minimal Separators in Graphs: Reductions, Sufficient Conditions, and a Dichotomy Theorem