4 papers
math.CO2026
Sufficient conditions for a special factor in a graph with minimum degree
Sizhong Zhou
Let be a graph. The size and the signless Laplacian spectral radius of are denoted by and , respectively. A spanning subgraph of is called an -fac…
math.CO2022
Some sufficient conditions for path-factor uniform graphs
Sizhong Zhou, Zhiren Sun, Hongxia Liu
For a set of connected graphs, a spanning subgraph of is called an -factor of if each component of is isomorphic to an element of $\mathc…
math.CO2019
A result on fractional (a,b,k)-critical covered graphs
Sizhong Zhou, Quanru Pan
For a graph , the set of vertices in is denoted by , and the set of edges in is denoted by . A fractional -factor of a graph is a function fro…
math.CO2019
Independence number and connectivity for fractional (a,b,k)-critical covered graphs
Sizhong Zhou, Jiancheng Wu, Hongxia Liu
A graph is a fractional -critical covered graph if is a fractional -covered graph for every with , which is first defined by Zhou…