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

In 2010, Mader [W. Mader, Connectivity keeping paths in $k$-connected graphs,J. Graph Theory 65 (2010) 61-69.] proved that every $k$-connected graph $G$with minimum degree at least $\lfloor\frac{3k}{2}\rfloor+m-1$ contains a path$P$ of order $m$ such that $G-V(P)$ is still $k$-connected. In this paper, weconsider similar problem for bipartite graphs, and prove that every$k$-connected bipartite graph $G$ with minimum degree at least $k+m$ contains apath $P$ of order $m$ such that $G-V(P)$ is still $k$-connected.

Connectivity keeping paths in $k$-connected bipartite graphs