Square roots of minor closed graph classes.

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