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

The prism over a graph $G$ is the cartesian product $G \Box K_2$. It is knownthat the property of having a Hamiltonian prism (prism-Hamiltonicity) isstronger than that of having a $2$-walk (spanning closed walk using everyvertex at most twice) and weaker than that of having a Hamilton path. For agraph $G$, it is known that $\alpha(G) \leq 2 \kappa(G)$, where $\alpha(G)$ isthe independence number and $\kappa(G)$ is the connectivity, imples existenceof a $2$-walk in $G$, and the bound is sharp. West asked for a bound on $\alpha(G)$ in terms of $\kappa (G)$ guaranteeing prism-Hamiltonicity. In this paperwe answer this question and prove that $\alpha(G) \leq 2 \kappa(G)$ implies thestronger condition, prism-Hamiltonicity of $G$.

The Chv\'atal-Erd\H{o}s condition for prism-Hamiltonicity