Square roots of nearly planar graphs

05/25/2022

∙

by   Zdeněk Dvořák, et al.

∙

0

∙

share

We prove that it is NP-hard to decide whether a graph is the square of a 6-apex graph. This shows that the square root problem is not tractable for squares of sparse graphs (or even graphs from proper minor-closed classes).