Jiancheng Wu

collaborators

2 papers

math.CO2025

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs

Jiancheng Wu, Sizhong Zhou

The binding number of a graph $G$ , written as $\mbox{bind}(G)$, is defined by $$ \mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\…

math.CO2019

Independence number and connectivity for fractional (a,b,k)-critical covered graphs

Sizhong Zhou, Jiancheng Wu, Hongxia Liu

A graph $G$ is a fractional $(a, b, k)$ -critical covered graph if $G - U$ is a fractional $[a, b]$ -covered graph for every $U \subseteq V (G)$ with $∣ U ∣ = k$ , which is first defined by Zhou…