3 papers
math.CO2026
Bricks that every removable edge is solitary
Jinxin Xue, Jun Ge, Fuliang Lu +1
A brick is a 3-connected graph such that has a perfect matching for any two distinct vertices . An edge in a matching covered graph is removable if…
math.CO2024
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…
math.CO2024
Planar wheel-like bricks
Fuliang Lu, Jinxin Xue
An edge e in a matching covered graph G is removable if G-e is matching covered; a pair {e; f} of edges of G is a removable doubleton if G-e-f is matching covered, but neither G-e…