activity
20232026
most citedMinimum forcing numbers of perfect matchings of circular and prismatic graphs

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

collaborators
Showing 2026Show all

1 paper · 1 filter

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…