most citedEquimatchable factor-critical graphs and independence number 2

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

collaborators

1 paper

math.CO2015★ 2 cited

Equimatchable factor-critical graphs and independence number 2

Eduard Eiben, Michal Kotrbcik

A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, a…