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

For a graph $G$, let $\sigma_{2}(G)$ be the minimum degree sum of twonon-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of$G$ joining two non-consecutive vertices of the cycle. In this paper, we provethe following result, which is an extension of a result of Brandt et al. (J.Graph Theory 24 (1997) 165-173) for large graphs: For positive integers $k$ and$c$, there exists an integer $f(k,c)$ such that, if $G$ is a graph of order $n\ge f(k, c)$ and $\sigma_{2}(G) \ge n$, then $G$ can be partitioned into $k$vertex-disjoint cycles, each of which has at least $c$ chords.

Partitioning a graph into cycles with a specified number of chords