Yezhou Wu

collaborators

2 papers

math.CO2020

On $3$ -flow-critical graphs

Jiaao Li, Yulai Ma, Yongtang Shi +2

A bridgeless graph $G$ is called $3$ -flow-critical if it does not admit a nowhere-zero $3$ -flow, but $G / e$ has for any $e \in E (G)$ . Tutte's $3$ -flow conjecture can be equivalently…

math.CO2018

Minimum $T$ -Joins and Signed-Circuit Covering

Yezhou Wu, Dong Ye

Let $G$ be a graph and $T$ be a vertex subset of $G$ with even cardinality. A $T$ -join of $G$ is a subset $J$ of edges such that a vertex of $G$ is incident with an odd number of e…

On 3-flow-critical graphs

Minimum T-Joins and Signed-Circuit Covering

On $3$ -flow-critical graphs

Minimum $T$ -Joins and Signed-Circuit Covering