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

The $\{K_2,C_n\}$-factor of a graph is a spanning subgraph whose eachcomponent is either $K_2$ or $C_n$. In this paper, a sufficient condition withregard to tight toughness, isolated toughness and binding number bounds toguarantee the existence of the $\{K_2,C_{2i+1}| i\geq 2 \}$-factor for anygraph is obtained, which answers a problem due to Gao and Wang (J. Oper. Res.Soc. China (2021), https://doi.org/10.1007/s40305-021-00357-6).

Tight toughness, isolated toughness and binding number bounds for the $\{K_2,C_n\}$-factors