Computing the forcing spectrum of outerplanar graphs in polynomial time

Maximilian Gorsky, Fabian Kreßin

The forcing number of a graph with a perfect matching $M$ is the minimum number of edges in $M$ whose endpoints need to be deleted, such that the remaining graph only has a single…