1 paper · 1 filter
Cheryl Grood, Ruth Haas, Bonnie Jacob +2
A graph in which all minimal zero forcing sets are in fact minimum size is called ``well-forced." This paper characterizes well-forced trees and presents an algorithm for determini…