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

Let $\Gamma$ be a chart, and we denote by $\Gamma_m$ the union of all theedges of label $m$. A chart $\Gamma$ is of type $(m;2,3,2)$ if $w(\Gamma)=7$,$w(\Gamma_m\cap\Gamma_{m+1})=2$, $w(\Gamma_{m+1}\cap\Gamma_{m+2})=3$, and$w(\Gamma_{m+2}\cap\Gamma_{m+3})=2$ where $w(G)$ is the number of whitevertices in $G$. In this paper, we prove that if there is a minimal chart$\Gamma$ of type $(m;2,3,2)$, then each of $\Gamma_{m+1}$ and $\Gamma_{m+2}$contains one of three kinds of graphs. In the next paper, we shall prove thatthere is no minimal chart of type $(m;2,3,2)$.

Properties of minimal charts and their applications VI: the graph $\Gamma_{m+1}$ in a chart $\Gamma$ of type $(m;2,3,2)$