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/

Zendy Plus

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

Zendy Tools

Zendy Open

We describe ${\rm Forb}\{K_{1,3}, \bar {K_{1,3}}\}$, the class of graphs $G$such that $G$ and its complement $\bar{G}$ are claw-free. With few exceptions,it is made of graphs whose connected components consist of cycles of length atleast 4, paths, and of the complements of these graphs. Considering thehypergraph ${\mathcal H}^{(3)}(G)$ made of the 3-element subsets of the vertexset of a graph $G$ on which $G$ induces a clique or an independent subset, wededuce from above a description of the Boolean sum $G\dot{+}G'$ of two graphs$G$ and $G'$ giving the same hypergraph. We indicate the role of this latterdescription in a reconstruction problem of graphs up to complementation.

Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem