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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Suppose [Formula: see text] is a subgraph of a convex complete graph [Formula: see text] and [Formula: see text] contains no boundary edge of [Formula: see text] and [Formula: see text]. We determine necessary and sufficient conditions on [Formula: see text] such that [Formula: see text] admits a triangulation. For [Formula: see text], we investigate the possibility of placing [Formula: see text] in [Formula: see text] such that [Formula: see text] admits a triangulation for certain families of graphs [Formula: see text]. These results are then applied to determine the convex skewness of the convex graphs of the form [Formula: see text].

Triangulability of convex graphs and convex skewness