2 papers
math.CO2026
Adjacent vertices of small degree in minimal matching covered graphs
Xiaoling He, Fuliang Lu, Heping Zhang
A connected graph with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge…
math.CO2025
Wheel-like bricks and minimal matching covered graphs
Xiaoling He, Fuliang Lu, Jinxin Xue
A connected graph G with at least two vertices is matching covered if each of its edges lies in a perfect matching. We say that an edge e in a matching covered graph G is removable…