Jiménez, AndreaAndreaJiménezTina Janne Schmidt2025-08-252025-08-252019-08-0110.1016/j.entcs.2019.08.0482-s2.0-85076258754https://cris-uv-2.scimago.es/handle/123456789/5675WOS:000488327500048The Topological Subgraph Containment (TSC) Problem is to decide, for two given graphs G and H, whether H is a topological subgraph of G. It is known that the TSC Problem is NP-complete when H is part of the input, that it can be solved in polynomial time when H is fixed, and that it is fixed-parameter tractable by the order of H. Motivated by the great significance of grids in graph theory and algorithms due to the Grid-Minor Theorem by Robertson and Seymour, we investigate the computational complexity of the Grid TSC Problem in planar graphs. More precisely, we study the following decision problem: given a positive integer k and a planar graph G, is the k × k grid a topological subgraph of G? We prove that this problem is NP-complete, even when restricted to planar graphs of maximum degree six, via a novel reduction from the Planar Monotone 3-SAT Problem.enacceso abiertoComputer ScienceTheoretical Computer Scienceconference paper