Yong Lu

collaborators

2 papers

math.CO2026

Some sufficient conditions for a graph with minimum degree to be $k$ -critical with respect to $[1, b]$ -odd factors

Jiaxu Zhong, Yong Lu

A graph $G$ is $k$ -factor-critical if $G - S$ has a perfect matching for every subset $S \subseteq V (G)$ with $∣ S ∣ = k$ . A spanning subgraph $H$ of $G$ is called a $[1, b]$ -odd factor i…

math.CO2025

Improved bounds on the $H$ -rank of a mixed graph in terms of the matching number and fractional matching number

Qi Wu, Yong Lu

A mixed graph $G$ is obtained by orienting some edges of a graph $G$ , where $G$ is the underlying graph of $G$ . Let $r (G)$ be the $H$ -rank of $\…

Some sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factors

Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number

Some sufficient conditions for a graph with minimum degree to be $k$ -critical with respect to $[1, b]$ -odd factors

Improved bounds on the $H$ -rank of a mixed graph in terms of the matching number and fractional matching number