Square Roots of Minor Closed Graph Classes

Let G be a graph class. The square root of G contains all graphs whose square belong in G . We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G . As a consequence, every square root of such a graph class has a linear time recognition algorithm.