3 citations · 4 across the 19 of their papers we have counts for
1 paper · 1 filter
Sarah E. Anderson, Kirsti Kuenzel, Douglas F. Rall
A graph is said to be well-edge-dominated if all its minimal edge dominating sets are minimum. It is known that every well-edge-dominated graph G is also equimatchable, meaning t…