Jinjiang Yuan

most citedA note on Matching Cover Algorithm

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2020

Even cycles and perfect matchings in claw-free plane graphs

Shanshan Zhang, Xiumei Wang, Jinjiang Yuan

Lov{á}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$ . Let $G$ be a graph which has a perfect matching. We call $G$ cycl…

math.CO2016★ 1 cited

A note on Matching Cover Algorithm

Xiumei Wang, Xiaoxin Song, Jinjiang Yuan

A $k$ -matching cover of a graph $G$ is a union of $k$ matchings of $G$ which covers $V (G)$ . A matching cover of $G$ is optimal if it consists of the fewest matchings of $G$ . In thi…