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 $G$ be a simple graph with $n\geq4$ vertices and $d(x)+d(y)\geq n+k$ foreach edge $xy\in E(G)$. In this work we prove that $G$ either contains aspanning closed trail containing any given edge set $X$ if $|X|\leq k$, or $G$is a well characterized graph. As a corollary, we show that line graphs of suchgraphs are $k$-hamiltonian.

A note on edge degree and spanning trail containing given edges