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 $t>0$ be a real number and $G$ be a graph. We say $G$ is $t$-tough if for every cutset $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. Determining toughness is an NP-hard problem for arbitrary graphs. The Toughness Conjecture of Chvatal, stating that there exists a constant $t_0$ such that every $t_0$-tough graph with at least three vertices is hamiltonian, is still open in general. A graph is called $(P_2\cup P_3)$-free if it does not contain any induced subgraph isomorphic to $P_2\cup P_3$, the union of two vertex-disjoint paths of order 2 and 3, respectively. In this paper, we show that every 15-tough $(P_2\cup P_3)$-free graph with at least three vertices is hamiltonian.

Hamiltonian Cycles in Tough $(P_2\cup P_3)$-Free Graphs