The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G → H which locally preserves the structure of the graphs). Complexity of this problem has been intensively studied. In this paper, we consider the problem PlanarCover(H) which restricts the input graph G to be planar.
PlanarCover(H) is polynomially solvable if Cover(H) belongs to P, and it is even trivially solvable if H has no planar cover. Thus the interesting cases are when H admits a planar cover, but Cover(H) is NP-complete. This also relates the problem to the long-standing Negami Conjecture which aims to describe all graphs having a planar cover. Kratochvíl asked whether there are non-trivial graphs for which Cover(H) is NP-complete but Planarcover(H) belongs to P.
We examine the first nontrivial cases of graphs H for which Cover(H) is NP-complete and which admit a planar cover. We prove NP-completeness of Planarcover(H) in these cases.
This is a preview of subscription content, log in to check access
Janczewski, R., Kosowski, A., Malafiejski, M.: The complexity of the l(p,q)-labeling problem for bipartite planar graphs of small degree. Discrete Mathematics 309(10), 3270–3279 (2009)MathSciNetCrossRefMATHGoogle Scholar
Kára, J., Kratochvíl, J., Wood, D.R.: On the complexity of the balanced vertex ordering problem. Discrete Mathematics & Theoretical Computer Science 9(1), 193–202 (2007)MathSciNetMATHGoogle Scholar