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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A pairing of a graph $G$ is a perfect matching of the complete graph havingthe same vertex set as $G$. If every pairing of $G$ can be extended to aHamiltonian cycle of the underlying complete graph using only edges from $G$,then $G$ has the PH-property. A somewhat weaker property is the PMH-property,whereby every perfect matching of $G$ can be extended to a Hamiltonian cycle of$G$. In an attempt to characterise all 4-regular graphs having the PH-property,we answer a question made in 2015 by Alahmadi et al. by showing that theCartesian product $C_p\square C_q$ of two cycles on $p$ and $q$ vertices doesnot have the PMH-property, except for $C_4\square C_4$ which is known to havethe PH-property.

Perfect matchings and Hamiltonicity in the Cartesian product of cycles