Square roots of nearly planar graphs
Discrete Mathematics
2023-07-17 v2 Combinatorics
Abstract
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).
Keywords
Cite
@article{arxiv.2205.12764,
title = {Square roots of nearly planar graphs},
author = {Zdeněk Dvořák and Benjamin Moore and Abhiruk Lahiri},
journal= {arXiv preprint arXiv:2205.12764},
year = {2023}
}
Comments
6 pages, no figures; v2: Corrected an author name