Yipei Zhang

collaborators

4 papers

math.CO2025

Claw-free bricks that every $b$ -invariant edge is solitary

Yipei Zhang, Xiumei Wang

A graph $G$ is a brick if it is 3-connected and $G - {u, v}$ has a perfect matching for any two distinct vertices $u$ and $v$ of $G$ . Lucchesi and Murty proposed a problem concernin…

math.CO2025

Solid bricks that every $b$ -invariant edge is solitary

Yipei Zhang, Xiumei Wang

A graph $G$ is a brick if it is 3-connected and $G - {u, v}$ has a perfect matching for any two distinct vertices $u$ and $v$ of $G$ . A brick $G$ is solid if for any two vertex disj…

math.CO2024

Removable edges in near-bipartite bricks

Yipei Zhang, Fuliang Lu, Xiumei Wang +1

An edge $e$ of a matching covered graph $G$ is removable if $G - e$ is also matching covered. The notion of removable edge arises in connection with ear decompositions of matching co…

math.CO2024

Claw-free minimal matching covered graphs

Yipei Zhang, Xiumei Wang, Jinjiang Yuan +2

A matching covered graph $G$ is minimal if for each edge $e$ of $G$ , $G - e$ is not matching covered. An edge $e$ of a matching covered graph $G$ is removable if $G - e$ is also matchi…

Claw-free bricks that every b-invariant edge is solitary

Solid bricks that every b-invariant edge is solitary

Removable edges in near-bipartite bricks

Claw-free minimal matching covered graphs

Claw-free bricks that every $b$ -invariant edge is solitary

Solid bricks that every $b$ -invariant edge is solitary