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 $tsp(G)$ denote the length of a shortest travelling salesman tour in agraph $G$. We prove that for any $\varepsilon>0$, there exists a simple$2$-connected planar cubic graph $G_1$ such that $tsp(G_1)\ge(1.25-\varepsilon)\cdot|V(G_1)|$, a simple $2$-connected bipartite cubic graph$G_2$ such that $tsp(G_2)\ge (1.2-\varepsilon)\cdot|V(G_2)|$, and a simple$3$-connected cubic graph $G_3$ such that $tsp(G_3)\ge(1.125-\varepsilon)\cdot|V(G_3)|$.

Simple cubic graphs with no short traveling salesman tour