1 paper
Amit Kumar Mallik, Ajit A. Diwan, Nishad Kothari
A connected graph, on four or more vertices, is matching covered (aka 1-extendable) if every edge is present in some perfect matching. An ear decomposition theorem exists for bipar…