Yuan Chen

collaborators

2 papers

math.CO2023

Sufficient conditions for the existence of path-factors with given properties

Hui Qin, Guowei Dai, Yuan Chen +2

A spanning subgraph $H$ of a graph $G$ is called a $P_{\geq k}$ -factor of $G$ if every component of $H$ is isomorphic to a path of order at least $k$ , where $k \geq 2$ is an integer.…

math.CO2018

Spanning trees with at most 4 leaves in $K_{1, 5} -$ free graphs

Yuan Chen, Pham Hoang Ha, Dang Dinh Hanh

In 2009, Kyaw proved that every $n$ -vertex connected $K_{1, 4}$ -free graph $G$ with $σ_{4} (G) \geq n - 1$ contains a spanning tree with at most $3$ leaves. In this paper, we prove an ana…

Sufficient conditions for the existence of path-factors with given properties

Spanning trees with at most 4 leaves in K1,5​−free graphs

Spanning trees with at most 4 leaves in $K_{1, 5} -$ free graphs