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

A graph is said to be $K_{1,r}$-free if it does not contain an inducedsubgraph isomorphic to $K_{1,r}$. An $\mathcal{F}$-factor is a spanningsubgraph $H$ such that each connected component of $H$ is isomorphic to somegraph in $\mathcal{F}$. In particular, $H$ is called an $\{P_2,P_3\}$-factor of$G$ if $\mathcal{F}=\{P_2,P_3\}$; $H$ is called an $\mathcal{S}_n$-factor of$G$ if $\mathcal{F}=\{K_{1,1},K_{1,2},K_{1,3},...,K_{1,n}\}$, where $n\geq2$. Aspanning subgraph of a graph $G$ is called a $\mathcal{P}_{\geq k}$-factor of$G$ if its each component is isomorphic to a path of order at least $k$, where$k\geq2$. A graph $G$ is called a $\mathcal{F}$-factor covered graph if thereis a $\mathcal{F}$-factor of $G$ including $e$ for any $e\in E(G)$. In thispaper, we give a minimum degree condition for a $K_{1,r}$-free graph to have an$\mathcal{S}_n$-factor and a $\mathcal{P}_{\geq 3}$-factor, respectively.Further, we obtain sufficient conditions for $K_{1,r}$-free graphs to be$\mathcal{P}_{\geq 2}$-factor, $\mathcal{P}_{\geq 3}$-factor or$\{P_2,P_3\}$-factor covered graphs. In addition, examples show that ourresults are sharp.

Component factors in $K_{1,r}$-free graphs