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

Given a simple graph $G$, denote by $\Delta(G)$, $\delta(G)$, and $\chi'(G)$the maximum degree, the minimum degree, and the chromatic index of $G$,respectively. We say $G$ is \emph{$\Delta$-critical} if $\chi'(G)=\Delta(G)+1$and $\chi'(H)\le \Delta(G)$ for every proper subgraph $H$ of $G$; and $G$ is\emph{overfull} if $|E(G)|>\Delta \lfloor |V(G)|/2 \rfloor$. Since a maximummatching in $G$ can have size at most $\lfloor |V(G)|/2 \rfloor$, it followsthat $\chi'(G) = \Delta(G) +1$ if $G$ is overfull. Conversely, let $G$ be a$\Delta$-critical graph. The well known overfull conjecture of Chetwynd andHilton asserts that $G$ is overfull provided $\Delta(G) > |V(G)|/3$. In thispaper, we show that any $\Delta$-critical graph $G$ is overfull if $\Delta(G) -7\delta(G)/4\ge(3|V(G)|-17)/4$.

The overfullness of graphs with small minimum degree and large maximum degree