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

Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positiveinteger $k$ and every finite tree $T$ with order $m$, every $k$-connected,finite graph $G$ with $\delta(G)\geq \lfloor\frac{3}{2}k\rfloor+m-1$ contains asubtree $T'$ isomorphic to $T$ such that $G-V(T')$ is $k$-connected. Theconjecture has been verified for paths, trees when $k=1$, and stars ordouble-stars when $k=2$. In this paper we verify the conjecture for two classesof trees when $k=2$.  For digraphs, Mader [J. Graph Theory 69 (2012) 324-329] conjectured thatevery $k$-connected digraph $D$ with minimum semi-degree$\delta(D)=min\{\delta^+(D),\delta^-(D)\}\geq 2k+m-1$ for a positive integer$m$ has a dipath $P$ of order $m$ with $\kappa(D-V(P))\geq k$. The conjecturehas only been verified for the dipath with $m=1$, and the dipath with $m=2$ and$k=1$. In this paper, we prove that every strongly connected digraph withminimum semi-degree $\delta(D)=min\{\delta^+(D),\delta^-(D)\}\geq m+1$ containsan oriented tree $T$ isomorphic to some given oriented stars or double-starswith order $m$ such that $D-V(T)$ is still strongly connected.

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs