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

We prove the following best possible result. Let $k\ge 2$ be an integer and $G$ be a graph of order $n$ with minimum degree at least $k$. Assume $n \ge 8k-16$ for even $n$ and $n \ge 6k-13$ for odd $n$. If the degree sum of each pair of nonadjacent vertices of $G$ is at least $n$, then for any given Hamiltonian cycle $C$ of $G$, $G$ has a $[k,\,k+1]$-factor containing $C$.

A $[k,k+1]$-Factor Containing A Given Hamiltonian Cycle