Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch +2

Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem i…