5 citations · 11 across the 5 of their papers we have counts for
5 papers · 1 filter
A note on removable edges in near-bricks
Deyu Wu, Yipei Zhang, Xiumei Wang
An edge of a matching covered graph is removable if is also matching covered. Carvalho, Lucchesi, and Murty showed that every brick different from and $\ove…
Even cycles and perfect matchings in claw-free plane graphs
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan
Lov{á}sz showed that a matching covered graph has an ear decomposition starting with an arbitrary edge of . Let be a graph which has a perfect matching. We call cycl…
Birkhoff-von Neumann Graphs that are PM-compact
Marcelo H. de Carvalho, Nishad Kothari, Xiumei Wang +1
A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph . In any investigation concerning the perfect matching polytope, one ma…
A note on Matching Cover Algorithm
Xiumei Wang, Xiaoxin Song, Jinjiang Yuan
A -matching cover of a graph is a union of matchings of which covers . A matching cover of is optimal if it consists of the fewest matchings of . In thi…
Three matching intersection property for matching covered graphs
Hao Lin, Xiumei Wang
In connection with Fulkerson's conjecture on cycle covers, Fan and Raspaud proposed a weaker conjecture: For every bridgeless cubic graph , there are three perfect matchings $M_…